A Simpler Linear-Time Recognition of Circular-Arc Graphs

被引：5
|
作者：
Kaplan, Haim [1 ]
Nussbaum, Yahav [1 ]
机构：
[1] Tel Aviv Univ, Blavatnik Sch Comp Sci, IL-69978 Tel Aviv, Israel
来源：
ALGORITHMICA | 2011年 / 61卷 / 03期
关键词：
Circular-arc graph; Circular-arc model; Recognition algorithm; Intersection graph; Consecutive-ones property; ALGORITHMS;
D O I：
10.1007/s00453-010-9432-y
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We give a linear-time recognition algorithm for circular-arc graphs based on the algorithm of Eschen and Spinrad (Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 128-137, 1993) and Eschen (PhD thesis, 1997). Our algorithm both improves the time bound of Eschen and Spinrad, and fixes some flaws in it. Our algorithm is simpler than the earlier linear-time recognition algorithm of McConnell (Algorithmica 37(2):93-147, 2003), which is the only linear time recognition algorithm previously known.
引用
收藏
页码：694 / 737
页数：44
相关论文
共 50 条
  • [21] Fully Dynamic Recognition of Proper Circular-Arc Graphs
    Francisco J. Soulignac
    [J]. Algorithmica, 2015, 71 : 904 - 968
  • [22] Fully Dynamic Recognition of Proper Circular-Arc Graphs
    Soulignac, Francisco J.
    [J]. ALGORITHMICA, 2015, 71 (04) : 904 - 968
  • [23] Characterizations and recognition of circular-arc graphs and subclasses: A survey
    Lin, Min Chih
    Szwarcfiter, Jayme L.
    [J]. DISCRETE MATHEMATICS, 2009, 309 (18) : 5618 - 5635
  • [24] Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
    Kaplan, Haim
    Nussbaum, Yahav
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (15) : 3216 - 3230
  • [25] A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs
    Lin, Min Chih
    Soulignac, Fancisco J.
    Szwarcfiter, Jayme L.
    [J]. ALGORITHM THEORY - SWAT 2008, 2008, 5124 : 355 - +
  • [26] Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
    Kaplan, Haim
    Nussbaum, Yahav
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 289 - +
  • [27] Pathwidth of circular-arc graphs
    Suchan, Karol
    Todinca, Ioan
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 258 - +
  • [28] CHARACTERIZING CIRCULAR-ARC GRAPHS
    TUCKER, A
    [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1970, 76 (06) : 1257 - &
  • [29] TREEWIDTH OF CIRCULAR-ARC GRAPHS
    SUNDARAM, R
    SINGH, KS
    RANGAN, CP
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (04) : 647 - 655
  • [30] TREEWIDTH OF CIRCULAR-ARC GRAPHS
    SUNDARAM, R
    SINGH, KS
    RANGAN, CP
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 41 - 41
12345