Algorithmic Aspects of Graph Connectivit

Algorithmic Aspects of Graph Connectivit

Pris
1 229,-
E-Bok
E-bøkene legges i din ARK-leseapp. Bøkene kan også lastes ned fra Din side.
×
Logg deg inn for å gjennomføre dette kjøpet med ett klikk!

Etter at kjøpet er gjennomført vil boken være tilgjengelig på «din side» og i ARK-appen
Skriv anmeldelse
Format E-Bok
Filformat PDF
Utgivelsesår 2008
Forlag Cambridge University Press
Språk Engelsk
ISBN 9781139883429
Serie Encyclopedia of Mathematics and its Applications
Se flere detaljer  

Om Algorithmic Aspects of Graph Connectivit

Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.


Kundevurderinger

ARKs anbefalinger

Det finnes ingen vurderinger av dette produktet. Skriv anmeldelse

Mer fra Toshihide Ibaraki (Kwansei Gakuin University, Japan); Hiroshi Nagamochi (Kyoto University, Japan)

Anbefalt


Tips en venn