Graph-Theoretic Concepts in Computer Science 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers

This book constitutes revised selected papers from the 41^{st
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.} 

Riassunto

This book constitutes revised selected papers from the 41
<sup>st

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.</sup> 

Dettagli sul prodotto

• Con la collaborazione di: Ernst W. Mayr (Editore), Erns W Mayr (Editore), Ernst W Mayr (Editore)
• Editore: Springer, Berlin
• Contenuto: Libro
• Forma del prodotto: Tascabile
• Data pubblicazione: 01.01.2016
• Categoria: Scienze naturali, medicina, informatica, tecnica > Informatica, EDP > Informatica
• EAN: 9783662531730
• ISBN: 978-3-662-53173-0
• Numero di pagine: 514
• Illustrazioni: XIV, 514 p. 106 illus.
• Dimensioni (della confezione): 15.6 x 23.5 x 23.8 cm
• Peso (della confezione): 816 g
• Serie: Lecture Notes in Computer Science > 9224; Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Theoretical Computer Science and General Issues
• Categorie: Geometrie, C, Algorithmen und Datenstrukturen, Data Science, Algorithms, Datenbanken, Grafikprogrammierung, Diskrete Mathematik, computer science, geometry, Computer Graphics, Discrete Mathematics in Computer Science, Algorithms & data structures, Numerical analysis, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Data structures (Computer science), Data Structures, Graphics programming, recognition algorithm, polynomial kernel, polynomial-time algorithm, NP-completeness, subgraph isomorphism