Limit search to available items
Book Cover
Author Conference on Graphtheoretic Concepts in Computer Science (36th : 2010 : Zarós, Crete)

Title Graph-theoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 : revised papers / Dimitrios M. Thilikos (ed.)
Published Berlin : Springer, 2010


Description 1 online resource (xiii, 338 pages) : illustrations
Series Lecture notes in computer science, 0302-9743 ; 6410. Advanced research in computing and software science
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science ; 6410. 0302-9743
Lecture notes in computer science. Advanced research in computing and software science.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Contents Invited Talks -- Algorithmic Barriers from Phase Transitions in Graphs -- Algorithmic Graph Minors and Bidimensionality -- Regular Talks -- Complexity Results for the Spanning Tree Congestion Problem -- max-cut and Containment Relations in Graphs -- The Longest Path Problem is Polynomial on Cocomparability Graphs -- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds -- On Stable Matchings and Flows -- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs -- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time -- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching -- Efficient Algorithms for Eulerian Extension -- On the Small Cycle Transversal of Planar Graphs -- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective -- Graphs that Admit Right Angle Crossing Drawings -- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs -- On the Boolean-Width of a Graph: Structure and Applications -- Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs -- Colouring Vertices of Triangle-Free Graphs -- A Quartic Kernel for Pathwidth-One Vertex Deletion -- Network Exploration by Silent and Oblivious Robots -- Uniform Sampling of Digraphs with a Fixed Degree Sequence -- Measuring Indifference: Unit Interval Vertex Deletion -- Parameterized Complexity of the Arc-Preserving Subsequence Problem -- From Path Graphs to Directed Path Graphs -- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces -- Efficient Broadcasting in Random Power Law Networks -- Graphs with Large Obstacle Numbers -- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree -- The Number of Bits Needed to Represent a Unit Disk Graph -- Lattices and Maximum Flow Algorithms in Planar Graphs
Summary Annotation The papers presented were carefully reviewed and selected from 94 initial submissions. They feature original results on all aspects of graph-theoretic concepts in computer science such as structural graph theory, graph grammars and graph rewriting systems
Bibliography Includes bibliographical references and index
Notes Print version record
Subject Graph theory -- Data processing -- Congresses
Computer science -- Congresses
Graph theory -- Congresses
Computer science.
Graph theory.
Graph theory -- Data processing.
Zarós <2010>
Genre/Form Conference papers and proceedings.
Conference papers and proceedings.
Actes de congrès.
Form Electronic book
Author Thilikos, Dimitrios M.
ISBN 9783642169267
Other Titles WG 2010