Coverart for item
The Resource Graph-theoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)

Graph-theoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)

Label
Graph-theoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers
Title
Graph-theoretic concepts in computer science
Title remainder
33rd international workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers
Statement of responsibility
Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.)
Title variation
WG 2007
Creator
Contributor
Provider
Subject
Genre
Language
eng
Summary
This book constitutes the thoroughly refereed post-proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007, held in Dornburg, Germany, in June 2007. The 30 revised full papers presented together with 1 invited paper were carefully selected from 99 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
Image bit depth
0
LC call number
QA166
LC item number
.G715 2007eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2007
http://bibfra.me/vocab/lite/meetingName
Conference on Graphtheoretic Concepts in Computer Science
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • SpringerLink
  • Brandstädt, Andreas
  • Kratsch, D.
  • Müller, Haiko
Series statement
Lecture Notes in Computer Science,
Series volume
4769
http://library.link/vocab/subjectName
  • Computer programming
  • Computer algorithms
  • Graph theory
  • Computer algorithms
  • Computer programming
  • Graph theory
  • Informatique
Label
Graph-theoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)
Instantiates
Publication
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Color
not applicable
Contents
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs -- Recognizing Bipartite Tolerance Graphs in Linear Time -- Graph Searching in a Crime Wave -- Monotonicity of Non-deterministic Graph Searching -- Tree-Width and Optimization in Bounded Degree Graphs -- On Restrictions of Balanced 2-Interval Graphs -- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions -- The Clique-Width of Tree-Power and Leaf-Power Graphs -- NLC-2 Graph Recognition and Isomorphism -- A Characterisation of the Minimal Triangulations of Permutation Graphs -- The 3-Steiner Root Problem -- On Finding Graph Clusterings with Maximum Modularity -- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs -- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs -- Approximation Algorithms for Geometric Intersection Graphs -- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem -- Mixing 3-Colourings in Bipartite Graphs -- Minimum-Weight Cycle Covers and Their Approximability -- On the Number of ?-Orientations -- Complexity and Approximation Results for the Connected Vertex Cover Problem -- Segmenting Strings Homogeneously Via Trees -- Characterisations and Linear-Time Recognition of Probe Cographs -- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete -- Proper Helly Circular-Arc Graphs -- Pathwidth of Circular-Arc Graphs -- Characterization and Recognition of Digraphs of Bounded Kelly-width -- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms -- Obtaining a Planar Graph by Vertex Deletion -- Mixed Search Number and Linear-Width of Interval and Split Graphs -- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation -- The Complexity of Bottleneck Labeled Graph Problems
Dimensions
unknown
Extent
1 online resource (xiii, 340 p.)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783540748380
Level of compression
uncompressed
Other physical details
ill.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
Stock number
978-3-540-74838-0
System control number
  • (OCoLC)232363494
  • (OCoLC)ocn232363494
Label
Graph-theoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)
Publication
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Color
not applicable
Contents
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs -- Recognizing Bipartite Tolerance Graphs in Linear Time -- Graph Searching in a Crime Wave -- Monotonicity of Non-deterministic Graph Searching -- Tree-Width and Optimization in Bounded Degree Graphs -- On Restrictions of Balanced 2-Interval Graphs -- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions -- The Clique-Width of Tree-Power and Leaf-Power Graphs -- NLC-2 Graph Recognition and Isomorphism -- A Characterisation of the Minimal Triangulations of Permutation Graphs -- The 3-Steiner Root Problem -- On Finding Graph Clusterings with Maximum Modularity -- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs -- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs -- Approximation Algorithms for Geometric Intersection Graphs -- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem -- Mixing 3-Colourings in Bipartite Graphs -- Minimum-Weight Cycle Covers and Their Approximability -- On the Number of ?-Orientations -- Complexity and Approximation Results for the Connected Vertex Cover Problem -- Segmenting Strings Homogeneously Via Trees -- Characterisations and Linear-Time Recognition of Probe Cographs -- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete -- Proper Helly Circular-Arc Graphs -- Pathwidth of Circular-Arc Graphs -- Characterization and Recognition of Digraphs of Bounded Kelly-width -- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms -- Obtaining a Planar Graph by Vertex Deletion -- Mixed Search Number and Linear-Width of Interval and Split Graphs -- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation -- The Complexity of Bottleneck Labeled Graph Problems
Dimensions
unknown
Extent
1 online resource (xiii, 340 p.)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783540748380
Level of compression
uncompressed
Other physical details
ill.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
Stock number
978-3-540-74838-0
System control number
  • (OCoLC)232363494
  • (OCoLC)ocn232363494

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...