A Simpler Linear-Time Recognition of Circular-Arc Graphs

被引：0
|
作者：
Haim Kaplan
Yahav Nussbaum
机构：
[1] Tel Aviv University,The Blavatnik School of Computer Science
来源：
Algorithmica | 2011年 / 61卷
关键词：
Circular-arc graph; Circular-arc model; Recognition algorithm; Intersection graph; Consecutive-ones property;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：43
相关论文
共 50 条
  • [1] A simpler linear-time recognition of circular-arc graphs
    Kaplan, Haim
    Nussbaum, Yahav
    [J]. ALGORITHM THEORY - SWAT 2006, PROCEEDINGS, 2006, 4059 : 41 - 52
  • [2] A Simpler Linear-Time Recognition of Circular-Arc Graphs
    Kaplan, Haim
    Nussbaum, Yahav
    [J]. ALGORITHMICA, 2011, 61 (03) : 694 - 737
  • [3] Linear-Time Recognition of Circular-Arc Graphs
    Ross M. McConnell
    [J]. Algorithmica , 2003, 37 : 93 - 147
  • [4] Linear-time recognition of circular-arc graphs
    McConnell, RM
    [J]. 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 386 - 394
  • [5] Linear-time recognition of circular-arc graphs
    McConnell, RM
    [J]. ALGORITHMICA, 2003, 37 (02) : 93 - 147
  • [6] Linear-Time Recognition of Helly Circular-Arc Models and Graphs
    Joeris, Benson L.
    Lin, Min Chih
    McConnell, Ross M.
    Spinrad, Jeremy P.
    Szwarcfiter, Jayme L.
    [J]. ALGORITHMICA, 2011, 59 (02) : 215 - 239
  • [7] Linear-Time Recognition of Helly Circular-Arc Models and Graphs
    Benson L. Joeris
    Min Chih Lin
    Ross M. McConnell
    Jeremy P. Spinrad
    Jayme L. Szwarcfiter
    [J]. Algorithmica, 2011, 59 : 215 - 239
  • [8] A linear-time algorithm for paired-domination on circular-arc graphs
    Lin, Ching-Chi
    Tu, Hai-Lun
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 591 : 99 - 105
  • [9] Characterizations and linear time recognition of Helly circular-arc graphs
    Lin, Min Chih
    Szwarcfiter, Jayme L.
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 73 - 82
  • [10] Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs
    Deng, XT
    Hell, P
    Huang, J
    [J]. SIAM JOURNAL ON COMPUTING, 1996, 25 (02) : 390 - 403
12345