English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs

Kratsch, D., McConnell, R., Mehlhorn, K., & Spinrad, J. P. (2006). Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM Journal on Computing, 36, 326-353.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kratsch, Dieter, Author
McConnell, Ross, Author
Mehlhorn, Kurt1, Author           
Spinrad, Jeremy P., Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2006-09-132006
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 314649
Other: Local-ID: C1256428004B93B8-90DAACD3D4A0C6A8C1256E20004505E1-mehlhorn06b
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: SIAM Journal on Computing
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 36 Sequence Number: - Start / End Page: 326 - 353 Identifier: ISSN: 0097-5397