Algorithms and complexity of sandwich problems in graphs

Martin Charles Golumbic; Haim Kaplan; Ron Shamir

doi:10.1007/3-540-57899-4_41

Algorithms and complexity of sandwich problems in graphs

Martin Charles Golumbic, Haim Kaplan, Ron Shamir

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Given two graphs G¹= (V, E¹) and G = (V, E²) such that E¹⊆ E², is there a graph G=(V. E) such that E¹⊆ E ⊆ E²which 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.

Original language	English
Title of host publication	Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings
Editors	Jan van Leeuwen
Publisher	Springer Verlag
Pages	57-69
Number of pages	13
ISBN (Print)	9783540578994
DOIs	https://doi.org/10.1007/3-540-57899-4_41
State	Published - 1994
Externally published	Yes
Event	19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1993 - Utrecht, Netherlands Duration: 16 Jun 1993 → 18 Jun 1993

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	790 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1993
Country/Territory	Netherlands
City	Utrecht
Period	16/06/93 → 18/06/93

Bibliographical note

Publisher Copyright:
© 1994, Springer Verlag. All rights reserved.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-57899-4_41

Cite this

Golumbic, M. C., Kaplan, H., & Shamir, R. (1994). Algorithms and complexity of sandwich problems in graphs. In J. van Leeuwen (Ed.), Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings (pp. 57-69). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 790 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-57899-4_41

Golumbic, Martin Charles ; Kaplan, Haim ; Shamir, Ron. / Algorithms and complexity of sandwich problems in graphs. Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings. editor / Jan van Leeuwen. Springer Verlag, 1994. pp. 57-69 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7901901c32db48278058d888474a672e,

title = "Algorithms and complexity of sandwich problems in graphs",

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.",

author = "Golumbic, {Martin Charles} and Haim Kaplan and Ron Shamir",

note = "Publisher Copyright: {\textcopyright} 1994, Springer Verlag. All rights reserved.; 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1993 ; Conference date: 16-06-1993 Through 18-06-1993",

year = "1994",

doi = "10.1007/3-540-57899-4_41",

language = "English",

isbn = "9783540578994",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "57--69",

editor = "{van Leeuwen}, Jan",

booktitle = "Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings",

address = "Germany",

}

Golumbic, MC, Kaplan, H & Shamir, R 1994, Algorithms and complexity of sandwich problems in graphs. in J van Leeuwen (ed.), Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 790 LNCS, Springer Verlag, pp. 57-69, 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1993, Utrecht, Netherlands, 16/06/93. https://doi.org/10.1007/3-540-57899-4_41

Algorithms and complexity of sandwich problems in graphs. / Golumbic, Martin Charles; Kaplan, Haim; Shamir, Ron.
Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings. ed. / Jan van Leeuwen. Springer Verlag, 1994. p. 57-69 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 790 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Algorithms and complexity of sandwich problems in graphs

AU - Golumbic, Martin Charles

AU - Kaplan, Haim

AU - Shamir, Ron

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79955785764&partnerID=8YFLogxK

U2 - 10.1007/3-540-57899-4_41

DO - 10.1007/3-540-57899-4_41

M3 - Conference contribution

AN - SCOPUS:79955785764

SN - 9783540578994

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 57

EP - 69

BT - Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings

A2 - van Leeuwen, Jan

PB - Springer Verlag

T2 - 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1993

Y2 - 16 June 1993 through 18 June 1993

ER -

Golumbic MC, Kaplan H, Shamir R. Algorithms and complexity of sandwich problems in graphs. In van Leeuwen J, editor, Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG 1993, Proceedings. Springer Verlag. 1994. p. 57-69. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-57899-4_41

Algorithms and complexity of sandwich problems in graphs

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this