Graph-theoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, revised selected papers. - Heidelberg ; New York : Springer, ©2012. - 1 online resource (xiii, 346 pages) - Lecture notes in computer science ; 7551 Serienbezeichnung . - Lecture notes in computer science ; 7551. LNCS sublibrary. SL 1, Theoretical computer science and general issues. .

Invited talks: Account on intervals / Constructing resilient structures in graphs: rigid vs. competitive fault-tolerance / Alternating reachability and integer sum of closed alternating trails / Poster session: Student poster session: Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern -- Papers: Triangulation and clique separator decomposition of claw-free graphs / Minimum weighted clique cover on strip-composed perfect graphs / Graph Isomorphism for graph classes characterized by two forbidden induced subgraphs / Optimization problems in dotted interval graphs / The maximum clique problem in multiple interval graphs (extended abstract) / Daniel Gonçalves, Pascal Ochem -- Solutions for the stable roommates problem with payments / Which multi-peg tower of Hanoi problems are exponential? / h-Quasi planar drawings of bounded treewidth graphs in linear area / The duals of upward planar graphs on cylinders / The (weighted) metric dimension of graphs: hard and easy cases / Determining the L(2,1)-span in polynomial space / On the minimum degree up to local complementation: bounds and complexity / On the stable degree of graphs / A 9k kernal for nonseparating independent set in planar graphs / Parameterized algorithms for Even Cycle Transversal / Bisections above tight lower bounds / On group feedback vertex set parameterized by the size of the cutest / Fault tolerant additive spanners / Multi-rooted greedy approximation of directed steiner trees with applications / Approximating infeasible 2VPI-systems / Hydras: directed hypergraphs and horn formulas / Minimum weight dynamo and fast opinion spreading / Immediate versus eventual conversion: comparing geodetic and hull numbers in P₃-convexity / Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill / On the recognition of k-Equistable graphs / Maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs and circle graphs / Parameterized domination in circle graphs / How to eliminate a graph / On the parameterized complexity of finding separators with non-hereditary properties / Dieter Rautenbach -- David Peleg -- Amitava Bhattacharya -- Anne Berry, Annegret Wagler -- Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels -- Stefan Kratsch, Pascal Schweitzer -- Danny Hermelin, Julián Mestre, Dror Rawitz -- Matthew C. Francis -- Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma -- Daniel Berend, Amir Sapir -- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani -- Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner -- Leah Epstein, Asaf Levin, Gerhard J. Woeginger -- Konstanty Junosza-Szaniawski, Jan Kratochvil, Mathieu Liedloff, Paweł -- Jérôme Javelle, Mehdi Mhalla, Simon Perdrix -- Haiko Müller -- Łukasz Kowalik, Marcin Mucha -- Pranabendu Misra, Venkatesh Raman, M.S. Ramnujan, Sakat Saurabh -- Matthias Mnich, Rico Zenklusen -- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk -- Gilad Braunschvig, Shiri Chechik, David Peleg -- Tomoya Hibi, Toshihiro Fujito -- Neele Leithäuser, Sven O. Krumke, Maximilian Merkert -- Robert H. Sloan, Despina Stasi, György Turán -- Sara Brunetti, Gennaro Cordasco, Luisa Gargano, Elena Lodi, Walter Quattrociocchi -- Carmen Cecilia Centeno, Lucia Draque Penso, Dietr Rautenbach -- Steven Chaplick, Vit Jelínek, Jan Kratochvil, Tomáš Vyskočil -- Vadim E. Levit, martin Milanič, David Tankus -- Ganica Gavril -- Nicolas Bousquet, Daniel Gonçlaves, George B. Mertzios, Christophe Paul, Ignasi Sau -- Petr A. Golovach, Pinar Heggernes, Pim van't Hof, Fredrik Manne, Daniël Paulusma -- Pinar Heggernes, Pim van't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger.

This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition.

3642346111 9783642346118

10.1007/978-3-642-34611-8 doi

Graph theory--Data processing--Congresses.
Computer science--Congresses.
Computer science.
Graph theory--Data processing.

computerwetenschappen computer sciences wiskunde mathematics algoritmen algorithms computeranalyse computer analysis kunstmatige intelligentie artificial intelligence gegevensstructuren data structures meetkunde geometry Information and Communication Technology (General) Informatie- en communicatietechnologie (algemeen)

Electronic books.
Conference papers and proceedings.
Computer software.

QA166 / .C66 2012


Powered by Koha