A polynomial time recognition algorithm for probe interval graphs

被引：0
|
作者：
Johnson, JL [1 ]
Spinrad, JP [1 ]
机构：
[1] Vanderbilt Univ, Dept EECS, Nashville, TN 37235 USA
来源：
PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2001年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Probe interval graphs were introduced to model a problem arising in a form of DNA sequencing. This paper presents an O(n(2)) algorithm for recognizing probe interval graphs. This is the first polynomial time recognition algorithm for this class.
引用
收藏
页码：477 / 486
页数：10
相关论文
共 50 条
  • [1] LINEAR-TIME RECOGNITION OF PROBE INTERVAL GRAPHS
    Mcconnell, Ross M.
    Nussbaum, Yahav
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (04) : 2006 - 2046
  • [2] Linear-Time Recognition of Probe Interval Graphs
    McConnell, Ross M.
    Nussbaum, Yahav
    [J]. ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 349 - +
  • [3] A polynomial time algorithm for the triangle packing problem on interval graphs
    Myung, Young-Soo
    [J]. DISCRETE APPLIED MATHEMATICS, 2024, 343 : 180 - 183
  • [4] A linear time recognition algorithm for proper interval graphs
    Panda, BS
    Das, SK
    [J]. INFORMATION PROCESSING LETTERS, 2003, 87 (03) : 153 - 161
  • [5] Recognition of probe proper interval graphs
    Nussbaum, Yahav
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 167 : 228 - 238
  • [6] Capturing Polynomial Time on Interval Graphs
    Laubner, Bastian
    [J]. 25TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2010), 2010, : 199 - 208
  • [7] A Polynomial Algorithm for Weighted Toughness of Interval Graphs
    Shi, Ming
    Wei, Zongtian
    [J]. JOURNAL OF MATHEMATICS, 2021, 2021
  • [8] A polynomial algorithm for weighted scattering number in interval graphs
    Li, Fengwei
    Zhang, Xiaoyan
    Broersma, Hajo
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 264 : 118 - 124
  • [9] Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs
    Brown, David E.
    Busch, Arthur H.
    Isaak, Garth
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2010, 12 (05): : 63 - 82
  • [10] A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
    Boyaci, Arman
    Ekim, Tinaz
    Shalom, Mordechai
    [J]. INFORMATION PROCESSING LETTERS, 2017, 121 : 29 - 33
12345