Coverart for item
The Resource 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.)

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.)

Label
Graph-theoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 : revised papers
Title
Graph-theoretic concepts in computer science
Title remainder
36th international workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 : revised papers
Statement of responsibility
Dimitrios M. Thilikos (ed.)
Title variation
WG 2010
Creator
Contributor
Subject
Genre
Language
eng
Summary
Annotation
Member of
Cataloging source
CUS
Dewey number
511.5
Illustrations
illustrations
Index
index present
LC call number
QA166
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2010
http://bibfra.me/vocab/lite/meetingName
Conference on Graphtheoretic Concepts in Computer Science
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Thilikos, Dimitrios M
Series statement
  • Lecture notes in computer science,
  • Advanced research in computing and software science
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
6410.
http://library.link/vocab/subjectName
  • Graph theory
  • Computer science
  • Graph theory
  • Informatique
  • Computer science
  • Graph theory
  • Graph theory
  • Informatik
  • Graphentheorie
  • Zarós <2010>
Summary expansion
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
Label
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.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
681653414
Extent
1 online resource (xiii, 338 pages)
Form of item
online
Isbn
9783642169267
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-16926-7
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-16925-0
Specific material designation
remote
System control number
(OCoLC)681653414
Label
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.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
681653414
Extent
1 online resource (xiii, 338 pages)
Form of item
online
Isbn
9783642169267
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-16926-7
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-16925-0
Specific material designation
remote
System control number
(OCoLC)681653414

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...