Pastāsti draugiem par šo preci:
Algorithmic Aspects of Graph Connectivity - Encyclopedia of Mathematics and its Applications Nagamochi, Hiroshi (Kyoto University, Japan)
Cena
€ 70,49
Pasūtīts no attālās noliktavas
Paredzamā piegāde . gada 6. - 20. nov.
Ziemassvētku dāvanas var atgriezt līdz 31. janvārim
Saņemiet paziņojumus par jauniem Nagamochi, Hiroshi (Kyoto University, Japan) izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
Pieejams arī kā:
Algorithmic Aspects of Graph Connectivity - Encyclopedia of Mathematics and its Applications
Nagamochi, Hiroshi (Kyoto University, Japan)
With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing.
391 pages, Worked examples or Exercises; 1 Tables, unspecified
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2019. gada 16. maijs |
| ISBN13 | 9781108735490 |
| Izdevēji | Cambridge University Press |
| Lapas | 391 |
| Izmēri | 156 × 233 × 23 mm · 598 g |
| Valoda | Angļu |
