Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for Algorithmic Aspects Of Domination In Graphs: 17 (Lecture...
Stock Image
Algorithmic Aspects of Domination in Graphs
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 52180172-n
Stock Image
Algorithmic Aspects Of Domination In Graphs (Hardcover)
Published by
World Scientific Publishing Co Pte Ltd, Singapore, 2026
ISBN 10: 9819817285
ISBN 13: 9789819817283
New
Hardcover
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9789819817283
Stock Image
Algorithmic Aspects Of Domination In Graphs (Lecture Notes Series on Computing)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # I-9789819817283
Stock Image
Algorithmic Aspects of Domination in Graphs
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 52180172
Stock Image
Algorithmic Aspects of Domination in Graphs
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 52180172
Buy Used
£ 108.73
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Algorithmic Aspects of Domination in Graphs
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 52180172-n
Buy New
£ 112.22
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Algorithmic Aspects Of Domination In Graphs
Published by
World Scientific Publishing Co Pte Ltd, SG, 2026
ISBN 10: 9819817285
ISBN 13: 9789819817283
New
Hardcover
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. 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. Seller Inventory # LU-9789819817283
Buy New
£ 137.41
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
Algorithmic Aspects Of Domination In Graphs: 17 (Lecture Notes Series on Computing)
Published by
World Scientific Publishing Co Pte Ltd, 2026
ISBN 10: 9819817285
ISBN 13: 9789819817283
New
Hardcover
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 360 pages. 3.94x3.94x2.36 inches. In Stock. Seller Inventory # x-9819817285
Buy New
£ 128.40
£ 12.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Seller Image
ALGORITHMIC ASPECTS OF DOMINATION IN GRAPHS
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. ALGORITHMIC ASPECTS OF DOMINATION IN GRAPHS | Chang Gerard Jennhwa | Buch | Englisch | 2026 | World Scientific | EAN 9789819817283 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 134464605
Stock Image
Algorithmic Aspects Of Domination In Graphs (Hardcover)
Published by
World Scientific Publishing Co Pte Ltd, Singapore, 2026
ISBN 10: 9819817285
ISBN 13: 9789819817283
New
Hardcover
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9789819817283
Buy New
£ 136.49
£ 37 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available