Häftad, Engelska, 2016
Del i serien SpringerBriefs in Mathematics
Generalized Connectivity of Graphs
719 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Beskrivning
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.
Produktinformation
- Utgivningsdatum: 2016-07-11
- Mått: 155 x 235 x 9 mm
- Vikt: 276 g
- Format: Häftad
- Språk: Engelska
- Serie: SpringerBriefs in Mathematics
- Antal sidor: 143
- Upplaga: 16001
- Förlag: Springer International Publishing AG
- ISBN: 9783319338279
Utforska kategorier
Recensioner i media
"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)
Butikslager
Ej i lager i butik.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.