• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Algorithmic Aspects of Domination in Graphs

Algorithmic Aspects of Domination in Graphs

Hardcover

Series: Lecture Notes Computing, Book 17

General ComputersGeneral MathematicsProgramming

ISBN10: 9819817285
ISBN13: 9789819817283
Publisher: World Scientific Publishing Company
Published: Jan 3 2026
Pages: 360
Weight: 1.43
Height: 0.81 Width: 6.00 Depth: 9.00
Language: English

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.

Also in

Programming