The homogeneous set sandwich problem

The homogeneous set sandwich problem

The graph sandwich problem for property Φ is defined as follows: Given two graphs G 1 = ( V, E 1) and G 2 = ( V, E 2) such that E 1 ⊆ E 2, is there a graph G = ( V, E) such that E 1 ⊆ E ⊆ E 2 which satisfies property Φ? We present a polynomialtime algorithm for solving the graph sandwich problem, wh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1998-07, Vol.67 (1), p.31-35
Hauptverfasser: Cerioli, Márcia R., Everett, Hazel, de Figueiredo, Celina M.H., Klein, Sulamita
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science
control theory
systems
Design of algorithms
Exact sciences and technology
Information processing
Information retrieval. Graph
Perfect graphs
Sandwich problems
Studies
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The graph sandwich problem for property Φ is defined as follows: Given two graphs G 1 = ( V, E 1) and G 2 = ( V, E 2) such that E 1 ⊆ E 2, is there a graph G = ( V, E) such that E 1 ⊆ E ⊆ E 2 which satisfies property Φ? We present a polynomialtime algorithm for solving the graph sandwich problem, when property Φ is “to contain a homogeneous set”. The algorithm presented also provides the graph G and a homogeneous set in G in case it exists.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(98)00076-3