PirateBay Download | chang g algorithmic aspects domination graphs 2026

chang g algorithmic aspects domination graphs 2026

Type:: E-books
Files:: 1
Size:: 10.4 MB
Uploaded On:: Jan. 22, 2026, 8:30 a.m.
Added By:: andryold1
Seeders:: 15
Leechers:: 0
Info Hash:: 45413FBB184A841F751770E89F14758B3A65C800

Textbook in PDF format 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. Preface Introduction to Domination in Graphs Design and Analysis of Algorithms Trees Chordal Graphs Interval Graphs Strongly Chordal Graphs Cocomparability Graphs and Asteroidal Triple-Free Graphs Permutation Graphs Distance-Hereditary Graphs

Get This Torrent

Chang G. Algorithmic Aspects of Domination in Graphs 2026.pdf 10.4 MB

Details for: Chang G. Algorithmic Aspects of Domination in Graphs 2026

chang g algorithmic aspects domination graphs 2026

Similar Posts: