Generalized Connectivity of Graphs (Paperback, 1st ed. 2016)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	SpringerBriefs in Mathematics
Release date:	July 2016
First published:	2016
Authors:	Xueliang Li • Yaping Mao
Dimensions:	235 x 155 x 9mm (L x W x T)
Format:	Paperback
Pages:	143
Edition:	1st ed. 2016
ISBN-13:	978-3-319-33827-9
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures
LSN:	3-319-33827-7
Barcode:	9783319338279

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!