Fortell venner om denne varen:
Algorithmic Aspects of Graph Connectivity - Encyclopedia of Mathematics and its Applications
Nagamochi, Hiroshi (Kyoto University, Japan)
Pris
元 480
Bestillingsvarer
Forventes levert 4. - 13. nov
Legg til iMusic ønskeliste
eller
Finnes også som:
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
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 16. mai 2019 |
| ISBN13 | 9781108735490 |
| Utgivere | Cambridge University Press |
| Antall sider | 391 |
| Mål | 156 × 234 × 20 mm · 800 g |
| Språk | Engelsk |
Se alt med Nagamochi, Hiroshi (Kyoto University, Japan) ( f.eks. Innbunden bok og Pocketbok )