Stability preserving transformations of graphs

Stability preserving transformations of graphs

Graph transformations proved useful for many algorithmic problems. In the present paper, we study this tool with respect to the maximum stable set problem. We first review available results on this topic and then propose an approach to uniformly describe and systematically develop graph transformati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research 2011-08, Vol.188 (1), p.331-341
1. Verfasser: Lozin, Vadim V.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Boolean
Business and Management
Combinatorics
Graphs
Neighborhoods
Operations research
Operations Research/Decision Theory
Preserving
Stability
Studies
Theory of Computation
Transformations
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Graph transformations proved useful for many algorithmic problems. In the present paper, we study this tool with respect to the maximum stable set problem. We first review available results on this topic and then propose an approach to uniformly describe and systematically develop graph transformations that do not change the size of a maximum stable set in the graph. The approach is illustrated by a number of new transformations.
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-008-0395-1