The Resource Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers, Dimitrios M. Thilikos (ed.)
Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers, Dimitrios M. Thilikos (ed.)
Resource Information
The item Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers, Dimitrios M. Thilikos (ed.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers, Dimitrios M. Thilikos (ed.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 Annotation
 Language
 eng
 Extent
 1 online resource (xiii, 338 pages)
 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
 maxcut 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 dDegenerate Graphs
 On the BooleanWidth of a Graph: Structure and Applications
 Generalized Graph Clustering: Recognizing (p, q)Cluster Graphs
 Colouring Vertices of TriangleFree Graphs
 A Quartic Kernel for PathwidthOne 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 ArcPreserving Subsequence Problem
 From Path Graphs to Directed Path Graphs
 Connections between ThetaGraphs, 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
 Isbn
 9783642169267
 Label
 Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers
 Title
 Graphtheoretic concepts in computer science
 Title remainder
 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers
 Statement of responsibility
 Dimitrios M. Thilikos (ed.)
 Title variation
 WG 2010
 Subject

 Computer science
 Computer science  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Graph theory
 Graph theory
 Graph theory  Congresses
 Graph theory  Data processing
 Graph theory  Data processing
 Graph theory  Data processing  Congresses
 Graphentheorie
 Informatik
 Informatique
 Zarós <2010>
 Computer science
 Language
 eng
 Summary
 Annotation
 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 graphtheoretic concepts in computer science such as structural graph theory, graph grammars and graph rewriting systems
 Label
 Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers, Dimitrios M. Thilikos (ed.)
 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  maxcut 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 dDegenerate Graphs  On the BooleanWidth of a Graph: Structure and Applications  Generalized Graph Clustering: Recognizing (p, q)Cluster Graphs  Colouring Vertices of TriangleFree Graphs  A Quartic Kernel for PathwidthOne 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 ArcPreserving Subsequence Problem  From Path Graphs to Directed Path Graphs  Connections between ThetaGraphs, 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/9783642169267
 Other physical details
 illustrations.
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642169250
 Specific material designation
 remote
 System control number
 (OCoLC)681653414
 Label
 Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers, Dimitrios M. Thilikos (ed.)
 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  maxcut 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 dDegenerate Graphs  On the BooleanWidth of a Graph: Structure and Applications  Generalized Graph Clustering: Recognizing (p, q)Cluster Graphs  Colouring Vertices of TriangleFree Graphs  A Quartic Kernel for PathwidthOne 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 ArcPreserving Subsequence Problem  From Path Graphs to Directed Path Graphs  Connections between ThetaGraphs, 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/9783642169267
 Other physical details
 illustrations.
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642169250
 Specific material designation
 remote
 System control number
 (OCoLC)681653414
Subject
 Computer science
 Computer science  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Graph theory
 Graph theory
 Graph theory  Congresses
 Graph theory  Data processing
 Graph theory  Data processing
 Graph theory  Data processing  Congresses
 Graphentheorie
 Informatik
 Informatique
 Zarós <2010>
 Computer science
Genre
Member of
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
 Lecture notes in computer science, 6410
 Lecture notes in computer science, 6410.
 Lecture notes in computer science, Advanced research in computing and software science
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/9NVyFbdHTkY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/9NVyFbdHTkY/">Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers, Dimitrios M. Thilikos (ed.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers, Dimitrios M. Thilikos (ed.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/9NVyFbdHTkY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/9NVyFbdHTkY/">Graphtheoretic concepts in computer science : 36th international workshop, WG 2010, Zarós, Crete, Greece, June 2830, 2010 : revised papers, Dimitrios M. Thilikos (ed.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>