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

Chang, Gerard Jennhwa

 
9789819817283: Algorithmic Aspects Of Domination In Graphs (Lecture Notes Series on Computing)
Hardcover
ISBN 10: 9819817285 ISBN 13: 9789819817283
Publisher: 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.

"synopsis" may belong to another edition of this title.

About the Author

Gerard Jennhwa Chang is a Professor Emeritus of the Department of Mathematics, National Taiwan University. He received a PhD degree in Operations Research from Cornell University. After that, he has served in National Central University, National Chiao-Tung University and National Taiwan University. He published 3 books and more than 200 papers in graph theory and its algorithms.

"About this title" may belong to another edition of this title.

Publisher
WSPC
Publication date
2025
Language
English
ISBN 10 
9819817285
ISBN 13 
9789819817283
Binding
Hardcover
Number of pages
360