Algorithmic aspects of graph connectivity

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 a...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux : Nagamochi Hiroshi (Auteur), Ibaraki Toshihide (Auteur)
Format : Livre
Langue : anglais
Titre complet : Algorithmic aspects of graph connectivity / Hiroshi Nagamochi,... Toshihide Ibaraki,...
Publié : Cambridge, New York : Cambridge University Press , impr. 2008, cop. 2008
Description matérielle : 1 vol. (XV-375 p.)
Collection : Encyclopedia of mathematics and its applications ; 123
Accès en ligne : Table des matières
Sujets :
LEADER 02815cam a2200493 4500
001 PPN130242217
003 http://www.sudoc.fr/130242217
005 20230124055600.0
010 |a 978-0-521-87864-7  |b rel. 
010 |a 0-521-87864-0  |b rel. 
020 |a US  |b 2008007560 
020 |a GB  |b A888210 
035 |a (OCoLC)317460082 
035 |z ocm234299212 
073 1 |a 9780521878647 
100 |a 20090107h20082008k y0frey0103 ba 
101 0 |a eng 
102 |a GB  |a US 
105 |a a a 001yy 
106 |a z 
200 1 |a Algorithmic aspects of graph connectivity  |b Texte imprimé  |f Hiroshi Nagamochi,... Toshihide Ibaraki,... 
210 |a Cambridge  |a New York  |c Cambridge University Press  |d impr. 2008, cop. 2008 
215 |a 1 vol. (XV-375 p.)  |c ill.  |d 25 cm 
225 2 |a Encyclopedia of mathematics and its applications  |v 123 
300 |a Table des matières  |u http://assets.cambridge.org/97805218/78647/toc/9780521878647_toc.pdf 
320 |a Bibliogr. p. 357-369. Index 
330 |a 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 comprehensively 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 
410 | |0 013804545  |t Encyclopedia of mathematics and its applications  |x 0953-4806  |v 123 
606 |3 PPN027315428  |a Théorie des graphes  |2 rameau 
606 |3 PPN027282171  |a Algorithmes  |2 rameau 
676 |a 511/.5  |v 22 
680 |a QA166.243  |b .N34 2008 
686 |a G.2.2  |2 acm 
700 1 |3 PPN13006369X  |a Nagamochi  |b Hiroshi  |f 1960-....  |4 070 
701 1 |3 PPN077872312  |a Ibaraki  |b Toshihide  |4 070 
801 3 |a FR  |b Abes  |c 20151127  |g AFNOR 
801 0 |b DLC  |g AACR2 
801 2 |b BTCTA  |g AACR2 
915 |5 441092208:639585078  |b 17998 
930 |5 441092208:639585078  |b 441092208  |a 05C75  |j u 
979 |a CCFA 
991 |5 441092208:639585078  |a exemplaire créé automatiquement par l'ABES 
997 |a CCFA  |b 17998  |d CMB  |e BAP  |s d  |c 05C75 
998 |a 849154