4 519 kr

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

"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

  • Utgivningsdatum1998-01-05
  • Mått152 x 229 x 33 mm
  • Vikt740 g
  • FormatInbunden
  • SpråkEngelska
  • SerieChapman & Hall/CRC Pure and Applied Mathematics
  • Antal sidor464
  • FörlagTaylor & Francis Inc
  • ISBN9780824700331