Graph-Theoretic Concepts in Computer Science

Beschreibung

This book constitutes the revised selected papers of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, held at Teplá Monastery, Czech Republic, in June 2011.
The 28 revised papers presented were carefully reviewed and selected from 52 submissions. The workshop aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, and by extracting new graph theoretic problems from applications.
This book constitutes the revised selected papers of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, held at Teplá Monastery, Czech Republic, in June 2011. The 28 revised papers presented were carefully reviewed and selected from 52 submissions. The workshop aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, and by extracting new graph theoretic problems from applications.
Up-to-date results Fast-track conference proceedings State-of-the-art research

Autor*in

Petr Kolman

Themen in »Graph-Theoretic Concepts in Computer Science«

NP-completeness combinatorial game parameterized complexity split graphs topological graph algorithm analysis and problem complexity data structures

Stimmen zu »Graph-Theoretic Concepts in Computer Science«

Details

Link teilen