In this paper, we show that for a fixed k, there is an NC algorithm that separates the graphs of rank-width at most k from those with rank-width at least 3k + 1. (C) 2018 Elsevier B.V. All rights reserved.
机构:
Univ Warwick, DIMAP, Coventry CV4 7AL, W Midlands, England
Univ Warwick, Math Inst, Coventry CV4 7AL, W Midlands, EnglandUniv Warwick, DIMAP, Coventry CV4 7AL, W Midlands, England
Lozin, Vadim V.
Milanic, Martin
论文数: 0引用数: 0
h-index: 0
机构:
Univ Primorska, UP IAM, SI-6000 Koper, Slovenia
Univ Primorska, UP FAMNIT, SI-6000 Koper, SloveniaUniv Warwick, DIMAP, Coventry CV4 7AL, W Midlands, England