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

Graph-Theoretic Concepts in Computer Science, Gunther Schmidt; Rudolf Berghammer


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

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

Автор: Gunther Schmidt; Rudolf Berghammer
Название:  Graph-Theoretic Concepts in Computer Science
ISBN: 9783540551218
Издательство: Springer
Классификация:
ISBN-10: 3540551212
Обложка/Формат: Paperback
Страницы: 256
Вес: 0.39 кг.
Дата издания: 29.01.1992
Серия: Lecture Notes in Computer Science
Язык: English
Размер: 234 x 156 x 15
Основная тема: Computer Science
Подзаголовок: 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: This volume contains contributions to the 17th of a series of annual workshops for researchers using graph-theoretic methods in computer science.


Graph-Theoretic Concepts in Computer Science

Автор: Christophe Paul; Michel Habib
Название: Graph-Theoretic Concepts in Computer Science
ISBN: 3642114083 ISBN-13(EAN): 9783642114083
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 computer scientists from all over the world (Australia, Belgium, Canada, China, Czech Republic, France, Germany, Greece, Israel, Japan, Korea, The Netherlands, Norway, Spain, UK, USA) attended the conference. Since1975, ithastakenplace20timesinGermany, fourtimesinTheNeth- lands, twice in Austria, as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France, Norway, and the UK. The conference aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from appli- tions. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists. There were 69 submissions. Each submission was reviewed by at least three, and on average four, Program Committee members. The Committee decided to accept 28 papers. Due to the competition and the limited schedule, some good papers could not be accepted. Theprogramalsoincludedexcellentinvitedtalks: onegivenbyDanielKr lon "AlgorithmsforClassesofGraphswithBoundedExpansion," the otherbyDavid Eppsteinon"Graph-TheoreticSolutionstoComputationalGeometryProblems." The proceedings contains two survey papers on these topics.

Game-Theoretic Learning and Distributed Optimization in Memoryless Multi-Agent Systems

Автор: Tatiana Tatarenko
Название: Game-Theoretic Learning and Distributed Optimization in Memoryless Multi-Agent Systems
ISBN: 3319654780 ISBN-13(EAN): 9783319654782
Издательство: Springer
Рейтинг:
Цена: 12577.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: These methods do not require the agents to have the full information about the system, but instead allow them to make their local decisions based only on the local information, possibly obtained during communication with their local neighbors.

Theoretical Computer Science and Discrete Mathematics

Автор: S. Arumugam; Jay Bagga; Lowell W. Beineke; B.S. Pa
Название: Theoretical Computer Science and Discrete Mathematics
ISBN: 3319644181 ISBN-13(EAN): 9783319644189
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The Roosevelt elk populate the parks along California`s north coast and comprise the largest land mammals in the parks. In a study spanning more than twenty years, Weckerly made key observations and conducted various investigations under a multitude of ecological conditions. Few authors have dedicated this much time and effort into a single research area.

Distributed Graph Algorithms for Computer Networks

Автор: Kayhan Erciyes
Название: Distributed Graph Algorithms for Computer Networks
ISBN: 1447158504 ISBN-13(EAN): 9781447158509
Издательство: Springer
Рейтинг:
Цена: 8384.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization;

Distributed Graph Algorithms for Computer Networks

Автор: Kayhan Erciyes
Название: Distributed Graph Algorithms for Computer Networks
ISBN: 1447151720 ISBN-13(EAN): 9781447151722
Издательство: Springer
Рейтинг:
Цена: 8384.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization;


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