Generalized Connectivity of Graphs
Xueliang Li, Yaping Mao
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Springer International Publishing
Naturwissenschaften, Medizin, Informatik, Technik / Sonstiges
Beschreibung
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.
Kundenbewertungen
Nordhaus-Gaddum-type result, Steiner tree, combinatorics, Connectivity of Graphs, open problems, conjectures, rainbow index of graphs, graph product, edge-disjoint Steiner trees, edge-connectivity, extremal graph, internally disjoint Steiner trees