Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Conditional Covering Problem: Algorithms on Some intersection Graphs - Akul Rana

englanti
2012-08-24
63,69 € 84,92 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 12-18 arkipäivässä

30 päivän palautusoikeus

This monogram explores some new variations of domination problems on some special graphs. An attempt has been made to present an up to date survey of related works done on different graph classes. It is written in a way that it is self contained for independent study. The presentation is logical and simple. The lemmas and theorems have been stated in logical way and illustration are given whenever necessary ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

This monogram explores some new variations of domination problems on some special graphs. An attempt has been made to present an up to date survey of related works done on different graph classes. It is written in a way that it is self contained for independent study. The presentation is logical and simple. The lemmas and theorems have been stated in logical way and illustration are given whenever necessary. Also examples are given for algorithms. It is hoped that the readers will benefit immensely from this monogram.

Lisätietoja

Kirjoittaja Akul Rana
Julkaisija LAP LAMBERT Academic Publishing
Julkaisuvuosi 2012
Kannen tyyppi Pehmeäkantinen
EAN 9783659223075
Kirjoita oma arvostelusi
Arvostelet: Conditional Covering Problem: Algorithms on Some intersection Graphs
Arvostelusi:

Goodreads-arvostelut

63,69 € 84,92 €