Algorithmic Aspects Of Domination In Graphs - Couverture rigide

Chang, Gerard Jennhwa

 
9789819817283: Algorithmic Aspects Of Domination In Graphs
Couverture rigide
ISBN 10 : 9819817285 ISBN 13 : 9789819817283
Editeur : WSPC, 2025

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
WSPC
Date d'édition
2025
Langue
anglais
ISBN 10 
9819817285
ISBN 13 
9789819817283
Reliure
Relié
Nombre de pages
360
Coordonnées du fabricant
World Scientific Publishing
https://www.worldscientific.com/

5 Toh Tuck Link
#01-01
596224
Singapour
Personne responsable
gpsr@libri.de
gpsr@libri.de

Friedensallee 273
Hamburg
22763
Allemagne