Certifying algorithms for recognizing interval graphs and permutation graphs (2006)
Cached
Download Links
- [www.cs.colostate.edu]
- [www.mpi-sb.mpg.de]
- [domino.mpi-inf.mpg.de]
- [www.cs.colostate.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | SIAM J. COMPUT |
| Citations: | 22 - 6 self |
BibTeX
@INPROCEEDINGS{Kratsch06certifyingalgorithms,
author = {Dieter Kratsch and Ross M. McConnell and Kurt Mehlhorn and Jeremy P. Spinrad},
title = {Certifying algorithms for recognizing interval graphs and permutation graphs},
booktitle = {SIAM J. COMPUT},
year = {2006},
pages = {158--167},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 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(|V|) time.
