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 条
  • [21] Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
    Kaplan, Haim
    Nussbaum, Yahav
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (15) : 3216 - 3230
  • [22] Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
    Kaplan, Haim
    Nussbaum, Yahav
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 289 - +
  • [23] ON POLYNOMIALS ORTHOGONAL ON A CIRCULAR-ARC
    MILOVANOVIC, GV
    RAJKOVIC, PM
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1994, 51 (01) : 1 - 13
  • [24] CONFORMITY OF CIRCULAR-ARC GEARS
    FRENCH, MJ
    JOURNAL OF MECHANICAL ENGINEERING SCIENCE, 1965, 7 (02): : 220 - &
  • [25] CIRCULAR-ARC DIGRAPHS - A CHARACTERIZATION
    SEN, M
    DAS, S
    WEST, DB
    JOURNAL OF GRAPH THEORY, 1989, 13 (05) : 581 - 592
  • [26] Pathwidth of circular-arc graphs
    Suchan, Karol
    Todinca, Ioan
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 258 - +
  • [27] TREEWIDTH OF CIRCULAR-ARC GRAPHS
    SUNDARAM, R
    SINGH, KS
    RANGAN, CP
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (04) : 647 - 655
  • [28] IRREDUNDANCY IN CIRCULAR-ARC GRAPHS
    GOLUMBIC, MC
    LASKAR, RC
    DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 79 - 89
  • [29] TREEWIDTH OF CIRCULAR-ARC GRAPHS
    SUNDARAM, R
    SINGH, KS
    RANGAN, CP
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 41 - 41
  • [30] COUNTING CIRCULAR-ARC INTERSECTIONS
    AGARWAL, PK
    PELLEGRINI, M
    SHARIR, M
    SIAM JOURNAL ON COMPUTING, 1993, 22 (04) : 778 - 793
12345