Certifying algorithms for recognizing interval graphs and permutation graphs

被引：46

作者：

Kratsch, Dieter ^{[1
]}

McConnell, Ross M.

Mehlhorn, Kurt

Spinrad, Jeremy P.

机构：

[1] Univ Metz, LITA, F-57045 Metz 01, France

[2] Colorado State Univ, Dept Comp Sci, Ft Collins, CO 80523 USA

[3] Max Planck Inst Informat, D-66123 Saarbrucken, Germany

[4] Vanderbilt Univ, Dept Elect Engn & Comp Sci, Nashville, TN 37235 USA

来源：

SIAM JOURNAL ON COMPUTING | 2006年 / 36卷 / 02期

关键词：

certificates; certifying algorithms; interval graphs; permutation graphs;

D O I：

10.1137/S0097539703437855

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is a piece of evidence that proves that the answer has not been compromised by a bug in the implementation. We give linear-time certifying algorithms for recognition of interval graphs and permutation graphs, and for a few other related problems. Previous algorithms fail to provide supporting evidence when they claim that the input graph is not a member of the class. We show that our certificates of nonmembership can be authenticated in O(vertical bar V vertical bar) time.

引用

页码：326 / 353

页数：28

共 50 条

[1] Certifying algorithms for recognizing interval graphs and permutation graphs
Kratsch, D
McConnell, RM
Mehlhorn, K
Spinrad, JP
PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 158 - 167
[2] Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs
Hsu, WL
Ma, TH
SIAM JOURNAL ON COMPUTING, 1999, 28 (03) : 1004 - 1020
[3] Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs
Hung, Ruo-Wei
Chang, Maw-Shang
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2010, PT 2, PROCEEDINGS, 2010, 6017 : 314 - +
[4] Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs
Hell, P
Huang, J
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (03) : 554 - 570
[5] 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
[6] 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 - +
[7] Recognizing edge clique graphs among interval graphs and probe interval graphs
Kong, Jing
Wu, Yaokun
APPLIED MATHEMATICS LETTERS, 2007, 20 (09) : 1000 - 1004
[8] EFFICIENT ALGORITHMS FOR COMPUTING THE RELIABILITY OF PERMUTATION AND INTERVAL-GRAPHS
ABOELFOTOH, HM
COLBOURN, CJ
NETWORKS, 1990, 20 (07) : 883 - 898
[9] Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
Yamazaki, Kazuaki
Saitoh, Toshiki
Kiyomi, Masashi
Uehara, Ryuhei
THEORETICAL COMPUTER SCIENCE, 2020, 806 (806) : 310 - 322
[10] Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs
Yamazaki, Kazuaki
Saitoh, Toshiki
Kiyomi, Masashi
Uehara, Ryuhei
WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2018, 2018, 10755 : 8 - 19

← 1 2 3 4 5 →