Algorithmic Aspects Of Domination In Graphs (Lecture Notes Series on Computing, Band 17) - Hardcover

Chang, Gerard Jennhwa

 
9789819817283: Algorithmic Aspects Of Domination In Graphs (Lecture Notes Series on Computing, Band 17)
Hardcover
ISBN 10: 9819817285 ISBN 13: 9789819817283
Verlag: WSPC, 2025

Inhaltsangabe

The domination problem in graph theory is to find a minimum sized vertex subset in a graph such that every vertex not in this set is adjacent to at least one vertex in this set. The domination problem and its variations serve as good models for many real problems including location problems in operations research. This comprehensive volume introduces domination and its variations in graphs from an algorithmic point of view. It examines the structures of various graph classes, including trees, chordal graphs, strongly chordal graphs, interval graphs, comparability graphs, permutation graphs, distance-hereditary graphs and generalizations of these graphs. These structure properties provide concepts for designing the algorithms. This useful reference text benefits researchers, academics, and graduate students in theoretical computer science, combinatorics, and operations research.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
WSPC
Erscheinungsdatum
2025
Sprache
Englisch
ISBN 10 
9819817285
ISBN 13 
9789819817283
Einband
Gebundene Ausgabe
Anzahl der Seiten
360
Kontakt zum Hersteller
preigu GmbH & Co. KG
mail@preigu.de

Lengericher Landstr. 19
Osnabrück
Niedersachsen
49078
Deutschland