finelybook
Algorithmic Aspects of Domination in Graphs
Author(s): Gerard Jennhwa Chang (Author)
- Publisher finelybook 出版社: World Scientific Publishing
- Publication Date 出版日期: January 30, 2026
- Language 语言: English
- Print length 页数: 360 pages
- ISBN-10: 9819817285
- ISBN-13: 9789819817283
Book Description
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.
Editorial Reviews
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.
下载地址
PDF | 9 MB | 2026-01-21
