000 04771nam a22005895i 4500
001 978-3-642-16926-7
003 DE-He213
005 20140220084550.0
007 cr nn 008mamaa
008 101110s2010 gw | s |||| 0|eng d
020 _a9783642169267
_9978-3-642-16926-7
024 7 _a10.1007/978-3-642-16926-7
_2doi
050 4 _aQA76.9.M35 
072 7 _aPBD
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aThilikos, Dimitrios M.
_eeditor.
245 1 0 _aGraph Theoretic Concepts in Computer Science
_h[electronic resource] :
_b36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers /
_cedited by Dimitrios M. Thilikos.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXIII, 338p. 62 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6410
505 0 _aInvited 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.
520 _aThis book constitutes the thoroughly refereed post-conference proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2010, held in Zarós, Crete, Greece, in June 2010. The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 94 initial submissions. The papers feature 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 - as well as applications of graph-theoretic concepts in Computer Science.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aAlgorithms.
650 0 _aGeometry.
650 1 4 _aComputer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aGeometry.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Communication Networks.
650 2 4 _aData Structures.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642169250
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6410
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-16926-7
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112879
_d112879