1.

Record Nr.

UNINA9910483847003321

Titolo

Graph-Theoretic Concepts in Computer Science : 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers / / edited by Dieter Kratsch, Ioan Todinca

Pubbl/distr/stampa

Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014

ISBN

3-319-12340-8

Edizione

[1st ed. 2014.]

Descrizione fisica

1 online resource (XI, 422 p. 81 illus.)

Collana

Lecture Notes in Computer Science, , 0302-9743 ; ; 8747

Disciplina

511.5

Soggetti

Computer scienceā€”Mathematics

Algorithms

Data structures (Computer science)

Geometry

Discrete Mathematics in Computer Science

Algorithm Analysis and Problem Complexity

Data Structures

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

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 -- Support of these concepts by suitable implementations and applications.

Sommario/riassunto

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.