Fundamentals of Domination in Graphs (Chapman & Hall/CRC Pure and Applied Mathematics)
Description:
"Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination."
We're an Amazon Associate. We earn from qualifying purchases at Amazon and all stores listed here.
Want a Better Price Offer?
Set a price alert and get notified when the book starts selling at your price.
Want to Report a Pricing Issue?
Let us know about the pricing issue you've noticed so that we can fix it.