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.
"synopsis" may belong to another edition of this title.
“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)
"About this title" may belong to another edition of this title.
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand. Seller Inventory # 272786f6195e43fda6ec356112a91215
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 26305071-n
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 26305071
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9783319338279
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 156 pp. Englisch. Seller Inventory # 9783319338279
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 130 1st ed. 2016 edition NO-PA16APR2015-KAP. Seller Inventory # 26374685506
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 143 pages. 9.25x6.10x0.37 inches. In Stock. Seller Inventory # x-3319338277
Quantity: 2 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 130. Seller Inventory # 371359901
Quantity: 4 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 130. Seller Inventory # 18374685512
Seller: moluna, Greven, Germany
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Brings together results, conjectures, and open problems on generalized connectivity Features theoretical and practical analysis for generalized (edge-) connectivity Contains essential proofs Noteworthy results, proof . Seller Inventory # 119491947
Quantity: Over 20 available