Given two graphs G1= (V, E1) and G = (V, E2) such that E1⊆ E2, is there a graph G=(V. E) such that E1⊆ E ⊆ E2which belongs to a specified graph family? Such problems generalize recognition problems and arise in various applications. Concentrating mainly on subfamilies of perfect graphs, we give polynomial algorithms for several families and prove the NP-completeness of others.
|Title of host publication||Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings|
|Editors||Jan van Leeuwen|
|Number of pages||13|
|State||Published - 1994|
|Event||19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1993 - Utrecht, Netherlands|
Duration: 16 Jun 1993 → 18 Jun 1993
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1993|
|Period||16/06/93 → 18/06/93|
Bibliographical notePublisher Copyright:
© 1994, Springer Verlag. All rights reserved.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)