株式会社極東書店トップ ＞ 商品一覧 ＞ Generalized Connectivity of Graphs. 1st ed. 2016
商品詳細
Generalized Connectivity of Graphs. 1st ed. 2016
・ISBN 978-3-319-33827-9 paper EUR 49.99
￥13,361.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
| 著者・編者 | Li, Xueliang / Mao, Yaping, |
|---|---|
| シリーズ | (SpringerBriefs in Mathematics) |
| 出版社 | (Springer International Publishing AG, SZ) |
| 出版年月 | 2016 |
| ページ数 | 143 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A04-98051＞ |
解説
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.