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 条
  • [31] CHARACTERIZING CIRCULAR-ARC GRAPHS
    TUCKER, A
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1970, 76 (06) : 1257 - &
  • [32] Power Domination in Circular-Arc Graphs
    Liao, Chung-Shou
    Lee, D. T.
    ALGORITHMICA, 2013, 65 (02) : 443 - 466
  • [33] NC ALGORITHMS FOR CIRCULAR-ARC GRAPHS
    CHEN, L
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 382 : 291 - 302
  • [34] INDEPENDENT SETS IN CIRCULAR-ARC GRAPHS
    HSU, WL
    SPINRAD, JP
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1995, 19 (02): : 145 - 160
  • [35] CLIPPING TO THE BOUNDARY OF A CIRCULAR-ARC POLYGON
    VANWYK, CJ
    COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1984, 25 (03): : 383 - 392
  • [36] The clique operator on circular-arc graphs
    Lin, Min Chih
    Soulignac, Francisco J.
    Szwarcfiter, Jayme L.
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (12) : 1259 - 1267
  • [37] Proper Helly circular-arc graphs
    Lin, Min Chih
    Soulignac, Francisco J.
    Szwarcfiter, Jayme L.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 248 - +
  • [38] DETECTION AND ESTIMATION OF CIRCULAR-ARC SEGMENTS
    LIM, KB
    XIN, K
    HONG, GS
    PATTERN RECOGNITION LETTERS, 1995, 16 (06) : 627 - 636
  • [39] Recognition of perfect circular-arc graphs
    Cameron, Kathie
    Eschen, Elaine A.
    Hoang, Chinh T.
    Sritharan, R.
    GRAPH THEORY IN PARIS: PROCEEDINGS OF A CONFERENCE IN MEMORY OF CALUDE BERGE, 2007, : 97 - +
  • [40] On interval and circular-arc covering problems
    Reuven Cohen
    Mira Gonen
    Annals of Operations Research, 2019, 275 : 281 - 295
12345