Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 201954.0, MPI für Informatik / Algorithms and Complexity Group
Certifying algorithms for recognizing interval graphs and permutation graph
Authors:Kratsch, Dieter; McConnell, R.; Mehlhorn, Kurt; Spinrad, J.
Language:English
Publisher:ACM
Place of Publication:New York, USA
Date of Publication (YYYY-MM-DD):2003
Title of Proceedings:Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03)
Start Page:158
End Page:167
Place of Conference/Meeting:Baltimore
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2004-01-12
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2004-06-17
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-90DAACD3D4A0C6A8C1256E20004505E1-...
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.