Algorithmic Aspects of Graph Connectivity Image close
Algorithmic Aspects of Graph Connectivity on Hardback by Hiroshi Nagamochi
Algorithmic Aspects of Graph Connectivity on Hardback by Hiroshi Nagamochi
Show Hide Adult Content
Algorithmic Aspects of Graph Connectivity close

Non-Fiction Books:

Home  
Books  
Non-Fiction  
Maths & Science  
Mathematics  
Combinatorics & graph theory

Algorithmic Aspects of Graph Connectivity

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Hardback
$253.99
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley

Buy Now, Pay Later with:

4 payments of $63.50 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 25 Jun - 5 Jul using International Courier

Explore more Encyclopedia of Mathematics and Its Applications

See all products in this series

Matroid Applications
$195.99
Matroid Applications
Paperback / softback
Available - Usually ships in 3-4 weeks
Random Graphs on Hardback by V.F. Kolchin
$314.99
Random Graphs
by V.F. Kolchin ~ Hardback
Available - Usually ships in 3-4 weeks
Combinatorics, Automata and Number Theory on Hardback
$465.99
Combinatorics, Automata and Number Theory
Hardback
Available - Usually ships in 3-4 weeks
Sperner Theory on Hardback by Konrad Engel
$364.99
Sperner Theory
by Konrad Engel ~ Hardback
Available - Usually ships in 3-4 weeks
Geometry of Chemical Graphs on Hardback by Michel Deza
$319.99
Geometry of Chemical Graphs
by Michel Deza ~ Hardback
Available - Usually ships in 3-4 weeks
Combinatorial Methods in Discrete Mathematics on Hardback by Vladimir N. Sachkov Save $91
$320.99
$411.99
Combinatorial Methods in Discrete Mathematics
by Vladimir N. Sachkov ~ Hardback
Available - Usually ships in 3-4 weeks
Eigenspaces of Graphs on Hardback by Peter Rowlinson
$317.99
Eigenspaces of Graphs
by Peter Rowlinson ~ Hardback
Available - Usually ships in 3-4 weeks
Topics in Topological Graph Theory on Hardback
$418.99
Topics in Topological Graph Theory
Hardback
Available - Usually ships in 3-4 weeks
Theory of Matroids
$183.99
Theory of Matroids
Paperback / softback
Available - Usually ships in 3-4 weeks
Eigenspaces of Graphs by Peter Rowlinson
$155.99
Eigenspaces of Graphs
by Peter Rowlinson ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Combinatorics, Words and Symbolic Dynamics on Hardback
$408.99
Combinatorics, Words and Symbolic Dynamics
Hardback
Available - Usually ships in 3-4 weeks
Coxeter Bialgebras on Hardback by Marcelo Aguiar
$390.99
Coxeter Bialgebras
by Marcelo Aguiar ~ Hardback
Available - Usually ships in 2-3 weeks
Bimonoids for Hyperplane Arrangements on Hardback by Marcelo Aguiar
$505.99
Bimonoids for Hyperplane Arrangements
by Marcelo Aguiar ~ Hardback
Available - Usually ships in 3-4 weeks
Algebraic Combinatorics on Words on Hardback by M. Lothaire
$406.99
Algebraic Combinatorics on Words
by M. Lothaire ~ Hardback
Available - Usually ships in 3-4 weeks
Combinatorial Geometries on Hardback
$317.99
Combinatorial Geometries
Hardback
Available - Usually ships in 3-4 weeks
Topics in Algebraic Graph Theory on Hardback
$373.99
Topics in Algebraic Graph Theory
Hardback
Available - Usually ships in 3-4 weeks

Description

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.

Author Biography:

Hiroshi Nagamochi is a professor at the Graduate School of Informatics, Kyoto University. 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 and professor emeritus of Kyoto University. He is a Fellow of the ACM and Operations Research Society of Japan.
Release date Australia
September 8th, 2008
Audience
  • Professional & Vocational
Illustrations
1 Tables, unspecified
Pages
392
Dimensions
160x234x33
ISBN-13
9780521878647
Product ID
2711285

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Explore more by Hiroshi Nagamochi

See all books by this author

Algorithmic Aspects of Graph Connectivity by Hiroshi Nagamochi
$138.99
Algorithmic Aspects of Graph Connectivity
by Hiroshi Nagamochi ~ Paperback / softback
Available - Usually ships in 3-4 weeks

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Non-Fiction >
Maths & Science >
Mathematics >
Combinatorics & graph theory
Books >
Computers & Internet >
Computer programming / software development >
Algorithms & data structures