Abstract
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.
Cite
CITATION STYLE
Golumbic, M. C., Kaplan, H., & Shamir, R. (1994). Algorithms and complexity of sandwich problems in graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 790 LNCS, pp. 57–69). Springer Verlag. https://doi.org/10.1007/3-540-57899-4_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
