Graphs Dieter Kratsch Ross M. McConnell + Kurt Mehlhorn Jeremy P. Spinrad  Home/Search
Context
Related
| mpisb.mpg.de/~mehlhorn/ftp/KMMS.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpiinf.mpg.de/~mehlhorn/...node1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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. (Update)
Active bibliography (related documents): More All
0.4: Tractability of Parameterized Completion Problems on.. - Kaplan, Shamir, Tarjan (1996) (Correct)
0.3: On-Line Recognition of Interval Graphs in O(m + log n) Time - Wen-Lian Hsu (Correct)
0.3: Tractability of Parameterized Completion Problems on.. - Kaplan, Shamir, Tarjan (1994) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ kratsch-certifying,
author = "Graphs Dieter Kratsch",
title = "Certifying Algorithms for Recognizing Interval Graphs and Permutation",
url = "citeseer.ist.psu.edu/745443.html" }
Citations (may not include all citations):488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
375 The LEDA Platform for Combinatorial and Geometric Computing - Mehlhorn, Naher - 1999
375 The LEDA platform for combinatorial and geometric computing - Mehlhorn, Naher et al. - 1997
201 Three partition refinement algorithms (context) - Paige, Tarjan - 1987
178 Algorithmic aspects of vertex elimination on graphs (context) - Rose, Tarjan et al. - 1976
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
135 and graph planarity using PQ-tree algorithms (context) - Booth, Lueker et al. - 1976
90 On rigid circuit graphs (context) - Dirac - 1961
89 A linear recognition algorithm for cographs (context) - Corneil, Perl et al. - 1985
84 The Design and Analysis of Algorithms (context) - Kozen - 1991
59 Representation of finite graphs by a set of intervals on the.. (context) - Lekkerkerker, Boland - 1962
55 Software reliability via run-time result-checking - Wasserman, Blum - 1997
43 Transitiv orientierbare Graphen (context) - Gallai - 1967
38 An incremental linear-time algorithm for recognizing interva.. (context) - Korte, Mohring - 1989
36 Checking geometric programs or verification of geometric str.. - Mehlhorn, Naher et al. - 1996
30 Modular decomposition and transitive orientation - McConnell, Spinrad - 1999
25 Doubly lexical orderings of matrices (context) - Lubiw - 1987
24 Graph Theory and Its Applications to Problems of Society (context) - Roberts - 1978
20 Doubly lexical ordering of dense 0-1 matrices (context) - Spinrad - 1993
15 Transitive orientation of graphs and identification of permu.. (context) - Pnueli, Lempel et al. - 1971
13 The ultimate interval graph recognition algorithm - Corneil, Lori et al. - 1998
13 SIAM Monographs on Discrete Mathematics and Applications (context) - Brandstadt, Le and et al. - 1999
6 with applications to transitive orientation (context) - Habib, McConnell et al. - 2000
3 Addendum: simple linear-time algorithms to test chordality o.. (context) - Tarjan, Yannakakis - 1985
3 Lecture Notes in Computer Science (context) - Hsu, test et al. - 1993
1 the common factors in a set of linear orders (context) - McConnell, de Montgolfier - 2004
1 PC Trees and Circular-Ones Arrangements (context) - Hsu, McConnell
Documents on the same site (http://www.mpi-inf.mpg.de/~mehlhorn/Journallist/node1.html): More
Certifying and Repairing Solutions to Large LPs -.. - Dhiflaoui, Funke, .. (Correct)
Implementation of O(nm log n) Weighted Matchings in General.. - Mehlhorn, Schäfer (Correct)
Implementing Minimum Cycle Basis Algorithms - Mehlhorn, Michail (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC