Graph Sandwich Problems (1994)
by
Martin Charles Golumbic
,
Haim Kaplan
,
Ron Shamir
| Citations: | 45 - 8 self |
BibTeX
@MISC{Golumbic94graphsandwich,
author = {Martin Charles Golumbic and Haim Kaplan and Ron Shamir},
title = {Graph Sandwich Problems},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The graph sandwich problem for property \Pi is defined as follows: Given two graphs G ) such that E ` E , is there a graph G = (V; E) such that E which satisfies property \Pi? Such problems generalize recognition problems and arise in various applications. Concentrating mainly on properties characterizing subfamilies of perfect graphs, we give polynomial algorithms for several properties and prove the NP-completeness of others. We describe
