Graph-Theoretic Concepts in Computer Science [electronic resource] : 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers / edited by Dieter Kratsch, Ioan Todinca.
Contributor(s): Kratsch, Dieter [editor.] | Todinca, Ioan [editor.] | SpringerLink (Online service).
Material type: BookSeries: Lecture Notes in Computer Science: 8747Publisher: Cham : Springer International Publishing : Imprint: Springer, 2014Description: XI, 422 p. 81 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319123400.Subject(s): Computer science | Data structures (Computer science) | Algorithms | Computer science -- Mathematics | Geometry | Computer Science | Discrete Mathematics in Computer Science | Algorithm Analysis and Problem Complexity | Data Structures | Geometry | AlgorithmsAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access onlineDesign and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms -- Structural graph theory with algorithmic or complexity applications -- Computational complexity of graph and network problems -- Graph grammars, graph rewriting systems and graph modeling -- Graph drawing and layouts -- Computational geometry -- Random graphs and models of the web and scale-free networks -- Support of these concepts by suitable implementations and applications.
This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014. The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.
There are no comments for this item.