ENGLISH

Graph-Theoretic Concepts in Computer Science: 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers

By Klaus Jansen , Andreas Brandstädt , Rüdiger Reischuk (eds.) , Feodor F. Dragan (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2013
ISBN
978-3-642-45042-6, 978-3-642-45043-3
DOI
10.1007/978-3-642-45043-3
Language
english
Format
PDF
Filesize
7 MB (6969453 bytes)
Series
Lecture Notes in Computer Science 8165 Theoretical Computer Science and General Issues
Edition
1
Pages
430\446
Time added
2014-01-18 08:00:00
Discrete Mathematics in Computer Science; Algorith

Description

This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.

Similar books