Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9224)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science
Conference proceedings info: WG 2015.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (35 papers)
-
Front Matter
-
Computational Complexity
-
Front Matter
-
About this book
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. They were organized in topical sections named: invited talks; computational complexity; design and analysis; computational geometry; structural graph theory; graph drawing; and fixed parameter tractability.
Keywords
- computational complexity
- exact algorithms
- geometric hypergraph
- parameterized complexity
- secure sets
- approximation algorithms
- chordal graphs
- complexity analysis
- extremal problems
- graph algorithms
- graph classes
- graph drawings
- graph theory
- grid graph
- kernelization
- NP-completeness
- polynomial kernel
- polynomial-time algorithm
- recognition algorithm
- subgraph isomorphism
- algorithm analysis and problem complexity
Editors and Affiliations
-
TU München Institut für Informatik, Garching, Germany
Ernst W. Mayr
Bibliographic Information
Book Title: Graph-Theoretic Concepts in Computer Science
Book Subtitle: 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers
Editors: Ernst W. Mayr
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-662-53174-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2016
Softcover ISBN: 978-3-662-53173-0Published: 05 August 2016
eBook ISBN: 978-3-662-53174-7Published: 04 August 2016
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIV, 514
Number of Illustrations: 106 b/w illustrations
Topics: Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity, Data Structures, Computer Graphics, Geometry, Algorithms