Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Graphtheoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)
Graphtheoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)
Resource Information
The item Graphtheoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Graphtheoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 This book constitutes the thoroughly refereed postproceedings of the 33rd International Workshop on GraphTheoretic 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 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, 340 p.)
 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 Nondeterministic Graph Searching
 TreeWidth and Optimization in Bounded Degree Graphs
 On Restrictions of Balanced 2Interval Graphs
 Graph Operations Characterizing RankWidth and Balanced Graph Expressions
 The CliqueWidth of TreePower and LeafPower Graphs
 NLC2 Graph Recognition and Isomorphism
 A Characterisation of the Minimal Triangulations of Permutation Graphs
 The 3Steiner 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 TwoPaths Problem in 3Connected Planar Graphs
 Approximation Algorithms for Geometric Intersection Graphs
 An Equivalent Version of the CaccettaHäggkvist Conjecture in an Online Load Balancing Problem
 Mixing 3Colourings in Bipartite Graphs
 MinimumWeight 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 LinearTime Recognition of Probe Cographs
 Recognition of PolygonCircle Graphs and Graphs of Interval Filaments Is NPComplete
 Proper Helly CircularArc Graphs
 Pathwidth of CircularArc Graphs
 Characterization and Recognition of Digraphs of Bounded Kellywidth
 How to Use Planarity Efficiently: New TreeDecomposition Based Algorithms
 Obtaining a Planar Graph by Vertex Deletion
 Mixed Search Number and LinearWidth of Interval and Split Graphs
 Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
 The Complexity of Bottleneck Labeled Graph Problems
 Isbn
 9783540748380
 Label
 Graphtheoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers
 Title
 Graphtheoretic concepts in computer science
 Title remainder
 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers
 Statement of responsibility
 Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.)
 Title variation
 WG 2007
 Subject

 Graph theory  Congresses
 Graph theory  Congresses
 Computer programming
 Computer algorithms  Congresses
 Graph theory  Congresses
 Computer programming  Congresses
 Conference proceedings
 Computer programming  Congresses
 Computer programming  Congresses
 Electronic resources
 Computer algorithms  Congresses
 Computer algorithms
 Graph theory
 Informatique
 Computer algorithms  Congresses
 Language
 eng
 Summary
 This book constitutes the thoroughly refereed postproceedings of the 33rd International Workshop on GraphTheoretic 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 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
 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
 Graphtheoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)
 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 Nondeterministic Graph Searching  TreeWidth and Optimization in Bounded Degree Graphs  On Restrictions of Balanced 2Interval Graphs  Graph Operations Characterizing RankWidth and Balanced Graph Expressions  The CliqueWidth of TreePower and LeafPower Graphs  NLC2 Graph Recognition and Isomorphism  A Characterisation of the Minimal Triangulations of Permutation Graphs  The 3Steiner 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 TwoPaths Problem in 3Connected Planar Graphs  Approximation Algorithms for Geometric Intersection Graphs  An Equivalent Version of the CaccettaHäggkvist Conjecture in an Online Load Balancing Problem  Mixing 3Colourings in Bipartite Graphs  MinimumWeight 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 LinearTime Recognition of Probe Cographs  Recognition of PolygonCircle Graphs and Graphs of Interval Filaments Is NPComplete  Proper Helly CircularArc Graphs  Pathwidth of CircularArc Graphs  Characterization and Recognition of Digraphs of Bounded Kellywidth  How to Use Planarity Efficiently: New TreeDecomposition Based Algorithms  Obtaining a Planar Graph by Vertex Deletion  Mixed Search Number and LinearWidth 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
 9783540748380
 System control number

 (OCoLC)232363494
 (OCoLC)ocn232363494
 Label
 Graphtheoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)
 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 Nondeterministic Graph Searching  TreeWidth and Optimization in Bounded Degree Graphs  On Restrictions of Balanced 2Interval Graphs  Graph Operations Characterizing RankWidth and Balanced Graph Expressions  The CliqueWidth of TreePower and LeafPower Graphs  NLC2 Graph Recognition and Isomorphism  A Characterisation of the Minimal Triangulations of Permutation Graphs  The 3Steiner 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 TwoPaths Problem in 3Connected Planar Graphs  Approximation Algorithms for Geometric Intersection Graphs  An Equivalent Version of the CaccettaHäggkvist Conjecture in an Online Load Balancing Problem  Mixing 3Colourings in Bipartite Graphs  MinimumWeight 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 LinearTime Recognition of Probe Cographs  Recognition of PolygonCircle Graphs and Graphs of Interval Filaments Is NPComplete  Proper Helly CircularArc Graphs  Pathwidth of CircularArc Graphs  Characterization and Recognition of Digraphs of Bounded Kellywidth  How to Use Planarity Efficiently: New TreeDecomposition Based Algorithms  Obtaining a Planar Graph by Vertex Deletion  Mixed Search Number and LinearWidth 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
 9783540748380
 System control number

 (OCoLC)232363494
 (OCoLC)ocn232363494
Subject
 Computer algorithms
 Computer algorithms  Congresses
 Computer algorithms  Congresses
 Computer algorithms  Congresses
 Computer programming
 Computer programming  Congresses
 Computer programming  Congresses
 Computer programming  Congresses
 Conference proceedings
 Electronic resources
 Graph theory
 Graph theory  Congresses
 Graph theory  Congresses
 Graph theory  Congresses
 Informatique
Genre
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
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.bu.edu/portal/Graphtheoreticconceptsincomputerscience/yuu7kOGsvsQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Graphtheoreticconceptsincomputerscience/yuu7kOGsvsQ/">Graphtheoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University 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 : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)
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.bu.edu/portal/Graphtheoreticconceptsincomputerscience/yuu7kOGsvsQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Graphtheoreticconceptsincomputerscience/yuu7kOGsvsQ/">Graphtheoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 2123, 2007 : revised papers, Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.), (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>