Certifying algorithms for recognizing interval graphs and permutation graph

Kratsch, Dieter; McConnell, R.; Mehlhorn, Kurt; Spinrad, J.

Local TagsRelease HistoryDetailsSummary

Certifying algorithms for recognizing interval graphs and permutation graph

Kratsch, D., McConnell, R., Mehlhorn, K., & Spinrad, J. (2003). Certifying algorithms for recognizing interval graphs and permutation graph. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03) (pp. 158-167). New York, USA: ACM.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2C71-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-4151-3

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Kratsch, Dieter, Author
McConnell, R., Author
Mehlhorn, Kurt¹, Author
Spinrad, J., Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2004-06-17Date issued: 2003

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 201954
Other: Local-ID: C1256428004B93B8-90DAACD3D4A0C6A8C1256E20004505E1-xxxx
BibTex Citekey: Kratsch-et-al:interval

Degree: -

Event

show

hide

Title: SODA 2003

Place of Event: Baltimore

Start-/End Date: 2004-01-12 - 2004-01-14

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03)

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, USA : ACM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 158 - 167 Identifier: -