Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7 707 857-29-98
  
  10:00-18:00 пн-пт
  shop@logobook.kz
   
    Поиск книг                        
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Бестселлеры | |
 

Generalized Connectivity of Graphs, Li


Варианты приобретения
Цена: 40270T
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: 12 шт.  
При оформлении заказа до: 17 фев 2025
Ориентировочная дата поставки: Март
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Li
Название:  Generalized Connectivity of Graphs
Издательство: Springer
Классификация:
ISBN: 3319338277
ISBN-13(EAN): 9783319338279
Обложка/Формат: Paperback
Страницы: 143
Вес: 0.297 кг.
Дата издания: 2016
Серия: SpringerBriefs in Mathematics
Язык: English
Иллюстрации: 22 black & white illustrations, 6 colour illustrations, 10 colour tables, biography
Размер: 236 x 155 x 9
Читательская аудитория: General (us: trade)
Рейтинг:
Поставляется из: Германии
Описание: 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.
Дополнительное описание: 1. Introduction.- 2. Results for some graph classes.- 3. Algorithm and complexity.- 4. Sharp bounds of the generalized (edge-) connectivity.- 5. Graphs with given generalized connectivity.- 6. Nordhaus-Gaddum-type results.- 7. Results for graph products.-


Algorithmic aspects of graph connectivity

Автор: Nagamochi, Hiroshi Ibaraki, Toshihide
Название: Algorithmic aspects of graph connectivity
ISBN: 0521878640 ISBN-13(EAN): 9780521878647
Издательство: Cambridge Academ
Рейтинг:
Цена: 79480 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing.

Graphs & Digraphs

Автор: Chartrand Gary
Название: Graphs & Digraphs
ISBN: 1498735762 ISBN-13(EAN): 9781498735766
Издательство: Taylor&Francis
Рейтинг:
Цена: 86930 T
Наличие на складе: Нет в наличии.
Описание:

Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory.

Fully updated and thoughtfully reorganized to make reading and locating material easier for instructors and students, the Sixth Edition of this bestselling, classroom-tested text:

  • Adds more than 160 new exercises
  • Presents many new concepts, theorems, and examples
  • Includes recent major contributions to long-standing conjectures such as the Hamiltonian Factorization Conjecture, 1-Factorization Conjecture, and Alspach's Conjecture on graph decompositions
  • Supplies a proof of the perfect graph theorem
  • Features a revised chapter on the probabilistic method in graph theory with many results integrated throughout the text

At the end of the book are indices and lists of mathematicians' names, terms, symbols, and useful references. There is also a section giving hints and solutions to all odd-numbered exercises. A complete solutions manual is available with qualifying course adoption.

Graphs & Digraphs, Sixth Edition remains the consummate text for an advanced undergraduate level or introductory graduate level course or two-semester sequence on graph theory, exploring the subject's fascinating history while covering a host of interesting problems and diverse applications.



Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2)
ТОО "Логобук" Тел:+7 707 857-29-98 , www.logobook.kz
Kaspi QR
   В Контакте     В Контакте Мед  Мобильная версия