Algorithmic Aspects of Graph Connectivity - Encyclopedia of Mathematics and its Applications - Nagamochi, Hiroshi (Kyoto University, Japan) - Books - Cambridge University Press - 9780521878647 - September 8, 2008
In case cover and title do not match, the title is correct

Nagamochi, Hiroshi (Kyoto University, Japan)
Algorithmic Aspects of Graph Connectivity - Encyclopedia of Mathematics and its Applications

Price
$ 129.99
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jul 9 - 21

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Not rated yet

Also available as:

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.

392 pages, 1 table

Media Books     Hardcover Book   (Book with hard spine and cover)
Released September 8, 2008
ISBN13 9780521878647
Publishers Cambridge University Press
Pages 392
Dimensions 160 × 234 × 33 mm   ·   680 g
Language English  

Mere med samme udgiver

See all of Nagamochi, Hiroshi (Kyoto University, Japan) ( e.g. Hardcover Book and Paperback Book )