Artículos relacionados a Generalized Connectivity of Graphs (SpringerBriefs...

Generalized Connectivity of Graphs (SpringerBriefs in Mathematics) - Tapa blanda

Libro 77 de 155: SpringerBriefs in Mathematics

Li, Xueliang

 
9783319338279: Generalized Connectivity of Graphs (SpringerBriefs in Mathematics)
Tapa blanda
ISBN 10: 3319338277 ISBN 13: 9783319338279
Editorial: Springer, 2016

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Críticas

"The monograph under review is devoted to the exposition of results about the generalized connectivity and generalized edge-connectivity of graphs. ... Reading it does not require significant background in the relevant fields, as most concepts are introduced and defined ... . I would recommend it for a researcher, graduate student, or senior undergraduate student who has an interest in pursuing research on this subject." (Joy M. W. Morris, Mathematical Reviews, April, 2017) "This book is a concise and elegant piece of work on an old yet new topic of combinatorics. ... The book may be of interest for those who work with communication networks, graph theory and combinatorial optimizations in general." (Yilun Shang, zbMATH 1346.05001, 2016)

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2016
Idioma
Inglés
ISBN 10 
3319338277
ISBN 13 
9783319338279
Encuadernación
Tapa blanda
Número de edición
1
Número de páginas
156
Contacto del fabricante
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Alemania