
Algorithmic Aspects Of Domination In Graphs
Gerard Jennhwa Chang(Author)
World Scientific Publishing Co Pte Ltd
Will be published approx. on 15. February 2026
Book
Hardback
200 pages
978-981-98-1728-3 (ISBN)
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.
More details
Series
Language
English
Place of publication
Singapore
Singapore
Target group
College/higher education
Professional and scholarly
Dimensions
Height: 235 mm
Width: 157 mm
Thickness: 24 mm
Weight
672 gr
ISBN-13
978-981-98-1728-3 (9789819817283)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification