Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers (Paperback, 2014 ed.)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Lecture Notes in Computer Science, 8747
Release date:	November 2014
First published:	2014
Editors:	Dieter Kratsch • Ioan Todinca
Dimensions:	235 x 155 x 23mm (L x W x T)
Format:	Paperback
Pages:	422
Edition:	2014 ed.
ISBN-13:	978-3-319-12339-4
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Geometry > General
LSN:	3-319-12339-4
Barcode:	9783319123394

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!