libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro

nagamochi hiroshi; ibaraki toshihide - algorithmic aspects of graph connectivity
Zoom

Algorithmic Aspects of Graph Connectivity

;




Disponibilità: Normalmente disponibile in 20 giorni
A causa di problematiche nell'approvvigionamento legate alla Brexit sono possibili ritardi nelle consegne.


PREZZO
119,98 €
NICEPRICE
113,98 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, Carta della Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Pubblicazione: 09/2008





Note Editore

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.




Sommario

1. Introduction; 2. MA ordering and forest decompositions; 3. Minimum cuts; 4. Cut enumeration; 5. Cactus representations; 6. Extreme vertex sets; 7. Edge-splitting; 8. Connectivity augmentation; 9. Source location problems; 10. Submodular and posi-modular set functions.




Prefazione

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.




Autore

Hiroshi Nagamochi is a professor at the Graduate School of Informatics, Kyoto University, Japan. He is a member of the Operations Research Society of Japan and the Information Processing Society.
Toshihide Ibaraki is a Professor with Kwansei Gakuin University, Japan and Professor Emeritus of Kyoto University, Japan. He is a Fellow of the ACM and Operations Research Society of Japan.










Altre Informazioni

ISBN:

9780521878647

Condizione: Nuovo
Collana: Encyclopedia of Mathematics and its Applications
Dimensioni: 234 x 33 x 160 mm Ø 680 gr
Formato: Copertina rigida
Illustration Notes:1 table
Pagine Arabe: 392


Dicono di noi