Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Algorithmic Aspects of Domination in Graphs

by Chang Gerard Jennhwa
Save 17% Save 17%
Current price ₹11,136.00
Original price ₹13,364.00
Original price ₹13,364.00
Original price ₹13,364.00
(-17%)
₹11,136.00
Current price ₹11,136.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9789819817283
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: World Scientific Publishing Company
  • Publisher Imprint: World Scientific Publishing Company
  • Publication Date:
  • Pages: 360
  • Original Price: USD 108.0
  • Language: English
  • Edition: N/A
  • Item Weight: 649 grams
  • BISAC Subject(s): Programming / Algorithms

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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us