Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach, Kurshan Robert P.

Автор: Mayr
Название: Graph-Theoretic Concepts in Computer Science
ISBN: 3662531739 ISBN-13(EAN): 9783662531730
Издательство: Springer
Рейтинг:
Цена: 10342.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes revised selected papers from the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015, held in Garching, Germany, in June 2015. The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions. structural graph theory; graph drawing;

Автор: Heggernes
Название: Graph-Theoretic Concepts in Computer Science
ISBN: 3662535351 ISBN-13(EAN): 9783662535356
Издательство: Springer
Рейтинг:
Цена: 8106.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes revised selected papers from the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2016, held in Istanbul, Turkey, in June 2016. The 25 papers presented in this volume were carefully reviewed and selected from 74 submissions.The WG conferences aim to connect theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas of computer science and by extracting new graph problems from applications. Their goal is to present new research results and to identify and explore directions of future research.

Автор: 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.