Fundamentals of Domination in Graphs

Av Teresa W. Haynes, Stephen Hedetniemi, Peter Slater

5479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Beskrivning

"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."

Produktinformation

Utgivningsdatum: 1998-01-05
Mått: 152 x 229 x 33 mm
Vikt: 740 g
Format: Inbunden
Språk: Engelska
Serie: Chapman & Hall/CRC Pure and Applied Mathematics
Antal sidor: 464
Förlag: Taylor & Francis Inc
ISBN: 9780824700331

Utforska kategorier

Mer information

Teresa W. Haynes, Stephen Hedetniemi, Peter Slater

Recensioner i media

"The book is very clearly written and the organization is outstanding. . ..Any reader will be able to quickly identify the methods used in the field and to appreciate the beauty and intricacy of the subject. One major achievement of the book is unification of the terminology used in domination. "---Bulletin of the Institute of Combinatorics and Its Applications"This long-awaited book provides the first comprehensive treatment of domination in graphs. It is an essential work in which a vast amount of recent work on domination has been extracted from the literature and re-organized into one comprehensive volume.... ...as a first book on domination it certainly fills a long-existing void very successfully, and it is hard to imagine now how researchers in domination theory every coped without it. "---Mathematical Reviews, 2001

Butikslager

Ej i lager i butik.

Betyg & recensioner

0 recensioner

Inga recensioner tillgängliga.