|
|
books
| book details |
Generalized Connectivity of Graphs
By (author) Xueliang Li, By (author) Yaping Mao
|
| on special |
normal price: R 2 192.95
Price: R 2 083.95
|
| book description |
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
| product details |
Normally shipped |
Publisher | Springer International Publishing AG
Published date | 11 Jul 2016
Language |
Format | Paperback / softback
Pages | 143
Dimensions | 235 x 155 x 0mm (L x W x H)
Weight | 0g
ISBN | 978-3-3193-3827-9
Readership Age |
BISAC | computers / programming / algorithms
| other options |
|
|
To view the items in your trolley please sign in.
| sign in |
|
|
|
| specials |
|
Victor Frankenstein driven by the mad dream of creating his own creature, experiments with alchemy and science to build a monster stitched together from dead remains.
|
This is indeed a story of mercy and the redemption it offers.
|
|
Katie Daysh
Paperback / softback
384 pages
was: R 295.95
now: R 259.95
|
|
|
|
|
