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.
Contents:
- 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
Readership: Researchers, professionals, academics and graduate students in theoretical computer science, combinatorics and operations research.
Betala smidigt med kort, Klarna, Apple Pay eller Google Pay. Är du inte nöjd har du alltid 14 dagars ångerrätt. Läs mer i våra villkor. Har du några frågor, mejla oss på hello@memmo.org.
Memmo gör det enklare att plugga – var du än är i världen. Hos oss samlar du kursböcker och smarta studieverktyg på ett och samma ställe: sammanfattningar, quiz, poddar och flashcards. Och så Ted, din studiekompis som svarar på allt du undrar. Över 75 000 studenter pluggar redan här – byggt för att du ska lära dig snabbare och stressa mindre.