Discusses graph domination. This book covers various developments in domination in graphs and digraphs, dominating functions, and combinatorial problems on chessboards.
"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."
Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.
Genom att registrera dig accepterar du vår personuppgiftspolicy.
