Produktnummer:
18da6e9abf79394edc87eb4a80f2233839
| Themengebiete: | algorithm analysis and problem complexity algorithms clique intersections data structures graph coloring graph connectivity planar graphs |
|---|---|
| Veröffentlichungsdatum: | 20.11.2013 |
| EAN: | 9783642450426 |
| Sprache: | Englisch |
| Seitenzahl: | 430 |
| Produktart: | Kartoniert / Broschiert |
| Herausgeber: | Brandstädt, Andreas Jansen, Klaus Reischuk, Rüdiger |
| Verlag: | Springer Berlin |
| Untertitel: | 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers |
Produktinformationen "Graph-Theoretic Concepts in Computer Science"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen