The Resource Graphtheoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)
Graphtheoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)
Resource Information
The item Graphtheoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers, Christophe Paul, Michel Habib (eds.) 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 : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers, Christophe Paul, Michel Habib (eds.) 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
 This book constitutes the thoroughly refereed postconference proceedings of the 35th International Workshop on GraphTheoretic Concepts in Computer Science, WG 2009, held in Montpellier, France, in June 2009. The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 69 submissions. The papers feature original results on all aspects of graphtheoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graphbased modeling, graphdrawing and layout, diagram methods, and support of these concepts by suitable implementations
 Language
 eng
 Extent
 1 online resource (xiii, 353 pages)
 Contents

 GraphTheoretic Solutions to Computational Geometry Problems
 Algorithms for Classes of Graphs with Bounded Expansion
 A Graph Polynomial Arising from Community Structure (Extended Abstract)
 Fast Exact Algorithms for Hamiltonicity in ClawFree Graphs
 Maximum SeriesParallel Subgraph
 LowPort Tree Representations
 Fully Dynamic Representations of Interval Graphs
 The Parameterized Complexity of Some Minimum Label Problems
 Exact and Parameterized Algorithms for Max Internal Spanning Tree
 An Exact Algorithm for Minimum Distortion Embedding
 Subcoloring and Hypocoloring Interval Graphs
 Parameterized Complexity of Generalized Domination Problems
 Connected Feedback Vertex Set in Planar Graphs
 Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)
 On ModuleComposed Graphs
 An Even Simpler LinearTime Algorithm for Verifying Minimum Spanning Trees
 The kDisjoint Paths Problem on Chordal Graphs
 Local Algorithms for Edge Colorings in UDGs
 Directed RankWidth and Displit Decomposition
 An Algorithmic Study of Switch Graphs
 Hardness Results and Efficient Algorithms for Graph Powers
 Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph
 Injective Oriented Colourings
 Chordal Digraphs
 A New Intersection Model and Improved Algorithms for Tolerance Graphs
 Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
 Distance dDomination Games
 Cycles, Paths, Connectivity and Diameter in Distance Graphs
 Smallest Odd Holes in ClawFree Graphs (Extended Abstract)
 Finding Induced Paths of Given Parity in ClawFree Graphs
 Isbn
 9783642114090
 Label
 Graphtheoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers
 Title
 Graphtheoretic concepts in computer science
 Title remainder
 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers
 Statement of responsibility
 Christophe Paul, Michel Habib (eds.)
 Title variation
 WG 2009
 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
 Informatique
 Computer science
 Language
 eng
 Summary
 This book constitutes the thoroughly refereed postconference proceedings of the 35th International Workshop on GraphTheoretic Concepts in Computer Science, WG 2009, held in Montpellier, France, in June 2009. The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 69 submissions. The papers feature original results on all aspects of graphtheoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graphbased modeling, graphdrawing and layout, diagram methods, and support of these concepts by suitable implementations
 Cataloging source
 GW5XE
 Dewey number
 511/.5
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA166
 LC item number
 .C664 2010
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2009
 http://bibfra.me/vocab/lite/meetingName
 Conference on Graphtheoretic Concepts in Computer Science
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName

 Paul, Christophe
 Habib, 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
 5911.
 http://library.link/vocab/subjectName

 Graph theory
 Computer science
 Graph theory
 Informatique
 Computer science
 Graph theory
 Graph theory
 Label
 Graphtheoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 mixed
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 GraphTheoretic Solutions to Computational Geometry Problems  Algorithms for Classes of Graphs with Bounded Expansion  A Graph Polynomial Arising from Community Structure (Extended Abstract)  Fast Exact Algorithms for Hamiltonicity in ClawFree Graphs  Maximum SeriesParallel Subgraph  LowPort Tree Representations  Fully Dynamic Representations of Interval Graphs  The Parameterized Complexity of Some Minimum Label Problems  Exact and Parameterized Algorithms for Max Internal Spanning Tree  An Exact Algorithm for Minimum Distortion Embedding  Subcoloring and Hypocoloring Interval Graphs  Parameterized Complexity of Generalized Domination Problems  Connected Feedback Vertex Set in Planar Graphs  Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)  On ModuleComposed Graphs  An Even Simpler LinearTime Algorithm for Verifying Minimum Spanning Trees  The kDisjoint Paths Problem on Chordal Graphs  Local Algorithms for Edge Colorings in UDGs  Directed RankWidth and Displit Decomposition  An Algorithmic Study of Switch Graphs  Hardness Results and Efficient Algorithms for Graph Powers  Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph  Injective Oriented Colourings  Chordal Digraphs  A New Intersection Model and Improved Algorithms for Tolerance Graphs  Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes  Distance dDomination Games  Cycles, Paths, Connectivity and Diameter in Distance Graphs  Smallest Odd Holes in ClawFree Graphs (Extended Abstract)  Finding Induced Paths of Given Parity in ClawFree Graphs
 Control code
 567359228
 Dimensions
 unknown
 Extent
 1 online resource (xiii, 353 pages)
 Form of item
 online
 Isbn
 9783642114090
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642114090.
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)567359228
 Label
 Graphtheoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 mixed
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 GraphTheoretic Solutions to Computational Geometry Problems  Algorithms for Classes of Graphs with Bounded Expansion  A Graph Polynomial Arising from Community Structure (Extended Abstract)  Fast Exact Algorithms for Hamiltonicity in ClawFree Graphs  Maximum SeriesParallel Subgraph  LowPort Tree Representations  Fully Dynamic Representations of Interval Graphs  The Parameterized Complexity of Some Minimum Label Problems  Exact and Parameterized Algorithms for Max Internal Spanning Tree  An Exact Algorithm for Minimum Distortion Embedding  Subcoloring and Hypocoloring Interval Graphs  Parameterized Complexity of Generalized Domination Problems  Connected Feedback Vertex Set in Planar Graphs  Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)  On ModuleComposed Graphs  An Even Simpler LinearTime Algorithm for Verifying Minimum Spanning Trees  The kDisjoint Paths Problem on Chordal Graphs  Local Algorithms for Edge Colorings in UDGs  Directed RankWidth and Displit Decomposition  An Algorithmic Study of Switch Graphs  Hardness Results and Efficient Algorithms for Graph Powers  Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph  Injective Oriented Colourings  Chordal Digraphs  A New Intersection Model and Improved Algorithms for Tolerance Graphs  Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes  Distance dDomination Games  Cycles, Paths, Connectivity and Diameter in Distance Graphs  Smallest Odd Holes in ClawFree Graphs (Extended Abstract)  Finding Induced Paths of Given Parity in ClawFree Graphs
 Control code
 567359228
 Dimensions
 unknown
 Extent
 1 online resource (xiii, 353 pages)
 Form of item
 online
 Isbn
 9783642114090
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642114090.
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)567359228
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
 Informatique
 Computer science
Genre
Member of
 Lecture notes in computer science, 5911
 Lecture notes in computer science, Advanced research in computing and software science
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
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/EVqwcfItkj0/" 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/EVqwcfItkj0/">Graphtheoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)</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 : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)
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/EVqwcfItkj0/" 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/EVqwcfItkj0/">Graphtheoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 2426, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)</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>