Generalized Connectivity of Graphs

de

,

Éditeur :

Springer


Paru le : 2016-06-30

eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
51,04

Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

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.

Pages
143 pages
Collection
n.c
Parution
2016-06-30
Marque
Springer
EAN papier
9783319338279
EAN EPUB
9783319338286

Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
14
Taille du fichier
3174 Ko
Prix
51,04 €

Suggestions personnalisées