The Branch-width of circular-arc

被引：5
|
作者：
Mazoit, F [1 ]
机构：
[1] Univ Aix Marseille 1, LIF, F-13453 Marseille 13, France
来源：
LATIN 2006: THEORETICAL INFORMATICS | 2006年 / 3887卷
关键词：
Branch-width; circular-arc graphs; algorithm;
D O I：
10.1007/11682462_66
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove that the branch-width of circular-arc graphs can be computed in polynomial time.
引用
收藏
页码：727 / 736
页数：10
相关论文
共 50 条
  • [41] Minor-Minimal Planar Graphs of Even Branch-Width
    Inkmann, Torsten
    Thomas, Robin
    COMBINATORICS PROBABILITY & COMPUTING, 2011, 20 (01): : 73 - 82
  • [42] Branch-width and well-quasi-ordering in matroids and graphs
    Geelen, JF
    Gerards, AMH
    Whittle, G
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 84 (02) : 270 - 290
  • [43] Partial Characterizations of Circular-Arc Graphs
    Bonomo, F.
    Duran, G.
    Grippo, L. N.
    Safe, M. D.
    JOURNAL OF GRAPH THEORY, 2009, 61 (04) : 289 - 306
  • [44] MATRIX CHARACTERIZATIONS OF CIRCULAR-ARC GRAPHS
    TUCKER, A
    PACIFIC JOURNAL OF MATHEMATICS, 1971, 39 (02) : 535 - &
  • [45] EFFICIENT TEST FOR CIRCULAR-ARC GRAPHS
    TUCKER, A
    SIAM JOURNAL ON COMPUTING, 1980, 9 (01) : 1 - 24
  • [46] PARALLEL ALGORITHMS ON CIRCULAR-ARC GRAPHS
    BERTOSSI, AA
    MORETTI, S
    INFORMATION PROCESSING LETTERS, 1990, 33 (06) : 275 - 281
  • [47] On the hyperbolicity constant of circular-arc graphs
    Reyes, Rosalio
    Rodriguez, Jose M.
    Sigarreta, Jose M.
    Villeta, Maria
    DISCRETE APPLIED MATHEMATICS, 2019, 263 : 244 - 256
  • [48] MINIMUM CUTS FOR CIRCULAR-ARC GRAPHS
    LEE, DT
    SARRAFZADEH, M
    WU, YF
    SIAM JOURNAL ON COMPUTING, 1990, 19 (06) : 1041 - 1050
  • [49] Power Domination in Circular-Arc Graphs
    Chung-Shou Liao
    D. T. Lee
    Algorithmica, 2013, 65 : 443 - 466
  • [50] PARALLEL ALGORITHMS ON CIRCULAR-ARC GRAPHS
    ANDREWS, MG
    LEE, DT
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1995, 5 (03): : 117 - 141
12345