Graph-Theoretic Concepts in Computer Science [electronic resource] : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011, Revised Papers / edited by Petr Kolman, Jan Kratochvíl.
Contributor(s): Kolman, Petr [editor.]
| Kratochvíl, Jan [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 6986Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011.Description: XI, 344 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642258701.Subject(s): Computer science -- Mathematics | Discrete mathematics | Algorithms | Geometry | Computer networks | Artificial intelligence -- Data processing | Discrete Mathematics in Computer Science | Algorithms | Geometry | Computer Communication Networks | Data ScienceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
No physical items for this record
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.
There are no comments for this item.