Coverart for item
The Resource Graph-theoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 24-26, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)

Graph-theoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 24-26, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)

Label
Graph-theoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 24-26, 2009 : revised papers
Title
Graph-theoretic concepts in computer science
Title remainder
35th international workshop, WG 2009, Montpellier, France, June 24-26, 2009 : revised papers
Statement of responsibility
Christophe Paul, Michel Habib (eds.)
Title variation
WG 2009
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the thoroughly refereed post-conference proceedings of the 35th International Workshop on Graph-Theoretic 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 graph-theoretic 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, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations
Member of
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
Graph-theoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 24-26, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)
Instantiates
Publication
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
Graph-Theoretic 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 Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port 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 -- Sub-coloring and Hypo-coloring 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 Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width 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 d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free 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/978-3-642-11409-0.
Other physical details
illustrations.
Specific material designation
remote
System control number
(OCoLC)567359228
Label
Graph-theoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 24-26, 2009 : revised papers, Christophe Paul, Michel Habib (eds.)
Publication
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
Graph-Theoretic 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 Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port 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 -- Sub-coloring and Hypo-coloring 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 Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width 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 d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free 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/978-3-642-11409-0.
Other physical details
illustrations.
Specific material designation
remote
System control number
(OCoLC)567359228

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