Контакты/Адрес/Проезд   Доставка и Оплата
История
  +7(495) 980-12-10
  10:00-18:00 пн-сб
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Специальные предложения | Бестселлеры
 
Информация
Online Каталоги
Каталог учебной литературы
по английскому языку >>>

Каталог учебной литературы
по английскому языку >>>


Properly Colored Connectivity of Graphs, Li Xueliang, Magnant Colton, Qin Zhongmei



Варианты приобретения
Цена: 4674р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: 71 шт.  Склад Америка: 126 шт.  
При оформлении заказа до: 24 апр 2020
Ориентировочная дата поставки: начало Июня

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

Автор: Li Xueliang, Magnant Colton, Qin Zhongmei
Название:  Properly Colored Connectivity of Graphs   (Ли Суэлян: Свойства расцвеченных связей графов)
Издательство: Springer
Классификация:
Комбинаторика и теория графа
Безопасность сети

ISBN: 3319896164
ISBN-13(EAN): 9783319896168
ISBN: 3-319-89616-4
ISBN-13(EAN): 978-3-319-89616-8
Обложка/Формат: Paperback
Страницы: 145
Вес: 0.227 кг.
Дата издания: 18.06.2018
Язык: ENG
Размер: 23.39 x 15.60 x 0.84 cm
Ссылка на Издательство: Link
Поставляется из: Германии
Описание:

A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references.

Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area.






Minimax Theorems and Qualitative Properties of the Solutions of Hemivariational Inequalities

Автор: Dumitru Motreanu; Panagiotis D. Panagiotopoulos
Название: Minimax Theorems and Qualitative Properties of the Solutions of Hemivariational Inequalities
ISBN: 0792354567 ISBN-13(EAN): 9780792354567
Издательство: Springer
Рейтинг:
Цена: 16825 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Studies a different type of eigenvalue problem, one that is very useful for applications: eigenvalue problems related to hemivariational inequalities, that is involving nonsmooth, nonconvex, energy functions. This book also studies nonresonant and resonant cases both for static and dynamic problems.

The Lefschetz Properties

Автор: Tadahito Harima; Toshiaki Maeno; Hideaki Morita; Y
Название: The Lefschetz Properties
ISBN: 3642382053 ISBN-13(EAN): 9783642382055
Издательство: Springer
Рейтинг:
Цена: 4207 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This is a monograph which collects basic techniques, major results and interesting applications of Lefschetz properties of Artinian algebras.

Difference Sets, Sequences and their Correlation Properties

Автор: A. Pott; P. Vijay Kumar; Tor Helleseth; Dieter Jun
Название: Difference Sets, Sequences and their Correlation Properties
ISBN: 0792359593 ISBN-13(EAN): 9780792359593
Издательство: Springer
Рейтинг:
Цена: 15427 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The explanation of the duality of Kerdock and Preparata codes is related to the discovery of large sets of quadriphase sequences over Z4 whose correlation properties are better than those of the best binary sequences. This title contains descriptions of the connection between difference sets, sequences and correlation properties of sequences.

Difference Sets, Sequences and their Correlation Properties

Автор: A. Pott; P. Vijay Kumar; Tor Helleseth; Dieter Jun
Название: Difference Sets, Sequences and their Correlation Properties
ISBN: 0792359585 ISBN-13(EAN): 9780792359586
Издательство: Springer
Рейтинг:
Цена: 22440 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The explanation of the formal duality of Kerdock and Preparata codes is related to the discovery of large sets of quadriphase sequences over Z4 whose correlation properties are better than those of the best binary sequences. This title describes the connection between difference sets, sequences and correlation properties of sequences.

Algorithmic aspects of graph connectivity

Автор: Nagamochi, Hiroshi Ibaraki, Toshihide
Название: Algorithmic aspects of graph connectivity
ISBN: 0521878640 ISBN-13(EAN): 9780521878647
Издательство: Cambridge Academ
Рейтинг:
Цена: 8117 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.

Generalized Connectivity of Graphs

Автор: Li
Название: Generalized Connectivity of Graphs
ISBN: 3319338277 ISBN-13(EAN): 9783319338279
Издательство: Springer
Рейтинг:
Цена: 4674 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия