This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in LA¼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.39th International Workshop, WG 2013, LA¼beck, Germany, June 19-21, 2013, Revised Papers Andreas BrandstAcdt, Klaus ... and Tamara Mchedlidze2 1 Universit`a degli Studi di Perugia, Italy 2 Karlsruhe Institute of Technology (KIT), Germany ... applications including, for example, the performance analysis of large communication and neural networks (see, e.g., [8]). ... Saks, and S Ios naturally raises the question about whether the length of the longest path tends to infinity as the size ofanbsp;...

Title | : | Graph-Theoretic Concepts in Computer Science |

Author | : | Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk |

Publisher | : | Springer - 2013-11-12 |

Continue