Borrow it
Coverart for item
The Resource Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (eds.)

Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (eds.)

Creator
Contributor
Summary
This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields
Language
eng
Work
Publication
Extent
1 online resource (x, 327 pages)
Contents
  • Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces
  • Data Management in Networks
  • Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
  • Approximate Constrained Bipartite Edge Coloring
  • Maximum Clique Transversals
  • On the Tree-Degree of Graphs
  • On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
  • (k+) -Disatance- Herediatry Graphs
  • On the Relationship between Clique-Width and Treewidth
  • Planarity of the 2-Level Cactus Model
  • Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
  • How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
  • (g, f)-Factorizations Orthogonal to k Subgraphs
  • On Star Coloring of Graphs
  • Graph Subcolorings: Complexity and Algorithms
  • Approximation of Pathwidth of Outerplanar Graphs
  • On the Monotonicity of Games Generated by Symmetric Submodular Functions
  • Multiple Hotlink Assignment
  • Small k-Dominating Sets in Planar Graphs with Applications
  • Lower Bounds for Algorithms for the Steiner Tree Problem
  • log n-Approximative NLCk-Decomposition in O(n 2k+1) Time
  • On Subfamilies of AT-Free Graphs
  • Complexity of Coloring Graphs without Forbidden Induced Subgraphs
  • On Stable Cutsets in Line Graphs
  • On Strong Menger-Connectivity of Star Graphs
  • The Complexity of the Matching-Cut Problem
  • De Bruijn Graphs and DNA Graphs
  • A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness
  • Critical and Anticritical Edges in Perfect Graphs
Isbn
9783540454779
Instance
Label
Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 ; proceedings
Title
Graph-theoretic concepts in computer science
Title remainder
27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 ; proceedings
Statement of responsibility
Andreas Brandstädt, Van Bang Le (eds.)
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields
Member of
Cataloging source
SCPER
Dewey number
004.015115
Illustrations
illustrations
Index
index present
LC call number
QA166
LC item number
.G7172 2001
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2001
http://bibfra.me/vocab/lite/meetingName
International Workshop WG
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Brandstädt, Andreas
  • Le, Van Bang
Series statement
  • Lecture notes in computer science,
  • Lecture notes in computer science. Lecture notes in artificial intelligence
Series volume
2204
http://library.link/vocab/subjectName
  • Computer science
  • Graph theory
  • Graph theory
  • Computer science
  • Graph theory
  • Graph theory
Label
Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (eds.)
Instantiates
Publication
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
Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect Graphs
Control code
325537993
Dimensions
unknown
Extent
1 online resource (x, 327 pages)
Form of item
online
Isbn
9783540454779
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-45477-2
Other physical details
illustrations.
Specific material designation
remote
System control number
(OCoLC)325537993
Label
Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (eds.)
Publication
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
Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect Graphs
Control code
325537993
Dimensions
unknown
Extent
1 online resource (x, 327 pages)
Form of item
online
Isbn
9783540454779
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-45477-2
Other physical details
illustrations.
Specific material designation
remote
System control number
(OCoLC)325537993

Subject

Genre

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...