Chang G Algorithmic Aspects of Domination in Graphs 2026
General:
Name: Chang G Algorithmic Aspects of Domination in Graphs 2026
Format: pdf
Size: 10.38 MB
Book:
Title: Algorithmic Aspects of Domination in Graphs (359 Pages)
Author: Gerard Jennhwa Chang
Language: angielski
Year: 2026
Subjects: N/A
Publisher: World Scientific Publishing Company, Incorporated
ISBN: 9789819817283
Total pages: 360
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.
Download from RapidGator
https://rapidgator.net/file/dfc51a5e033a1796e747aa7d0d0ad183/13ok2xb0hs5j5l81ssd8l5.pdf