The Resource Graphtheoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (eds.)
Graphtheoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (eds.)
Resource Information
The item Graphtheoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (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 1 library branch.
Resource Information
The item Graphtheoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (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 1 library branch.
 Summary
 This book constitutes the thoroughly refereed postworkshop proceedings of the 27th International Workshop on GraphTheoretic 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 graphtheoretical applications in various fields
 Language
 eng
 Extent
 1 online resource (x, 327 pages)
 Contents

 Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces
 Data Management in Networks
 EdgeIsoperimetric Problems for Cartesian Powers of Regular Graphs
 Approximate Constrained Bipartite Edge Coloring
 Maximum Clique Transversals
 On the TreeDegree of Graphs
 On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
 (k+) Disatance Herediatry Graphs
 On the Relationship between CliqueWidth and Treewidth
 Planarity of the 2Level Cactus Model
 Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
 How to Solve NPhard Graph Problems on CliqueWidth 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 kDominating Sets in Planar Graphs with Applications
 Lower Bounds for Algorithms for the Steiner Tree Problem
 log nApproximative NLCkDecomposition in O(n 2k+1) Time
 On Subfamilies of ATFree Graphs
 Complexity of Coloring Graphs without Forbidden Induced Subgraphs
 On Stable Cutsets in Line Graphs
 On Strong MengerConnectivity of Star Graphs
 The Complexity of the MatchingCut Problem
 De Bruijn Graphs and DNA Graphs
 A Generic Greedy Algorithm, PartiallyOrdered Graphs and NPCompleteness
 Critical and Anticritical Edges in Perfect Graphs
 Isbn
 9783540454779
 Label
 Graphtheoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings
 Title
 Graphtheoretic concepts in computer science
 Title remainder
 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings
 Statement of responsibility
 Andreas Brandstädt, Van Bang Le (eds.)
 Language
 eng
 Summary
 This book constitutes the thoroughly refereed postworkshop proceedings of the 27th International Workshop on GraphTheoretic 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 graphtheoretical applications in various fields
 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
 Graphtheoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (eds.)
 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  EdgeIsoperimetric Problems for Cartesian Powers of Regular Graphs  Approximate Constrained Bipartite Edge Coloring  Maximum Clique Transversals  On the TreeDegree of Graphs  On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms  (k+) Disatance Herediatry Graphs  On the Relationship between CliqueWidth and Treewidth  Planarity of the 2Level Cactus Model  Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach  How to Solve NPhard Graph Problems on CliqueWidth 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 kDominating Sets in Planar Graphs with Applications  Lower Bounds for Algorithms for the Steiner Tree Problem  log nApproximative NLCkDecomposition in O(n 2k+1) Time  On Subfamilies of ATFree Graphs  Complexity of Coloring Graphs without Forbidden Induced Subgraphs  On Stable Cutsets in Line Graphs  On Strong MengerConnectivity of Star Graphs  The Complexity of the MatchingCut Problem  De Bruijn Graphs and DNA Graphs  A Generic Greedy Algorithm, PartiallyOrdered Graphs and NPCompleteness  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/3540454772
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)325537993
 Label
 Graphtheoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (eds.)
 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  EdgeIsoperimetric Problems for Cartesian Powers of Regular Graphs  Approximate Constrained Bipartite Edge Coloring  Maximum Clique Transversals  On the TreeDegree of Graphs  On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms  (k+) Disatance Herediatry Graphs  On the Relationship between CliqueWidth and Treewidth  Planarity of the 2Level Cactus Model  Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach  How to Solve NPhard Graph Problems on CliqueWidth 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 kDominating Sets in Planar Graphs with Applications  Lower Bounds for Algorithms for the Steiner Tree Problem  log nApproximative NLCkDecomposition in O(n 2k+1) Time  On Subfamilies of ATFree Graphs  Complexity of Coloring Graphs without Forbidden Induced Subgraphs  On Stable Cutsets in Line Graphs  On Strong MengerConnectivity of Star Graphs  The Complexity of the MatchingCut Problem  De Bruijn Graphs and DNA Graphs  A Generic Greedy Algorithm, PartiallyOrdered Graphs and NPCompleteness  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/3540454772
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)325537993
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
 Computer science
Genre
Member of
 Lecture notes in computer science, 2204.
 Lecture notes in computer science, Lecture notes in artificial intelligence
 Lecture notes in computer science, 2204
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/fc2LDg3yGTE/" 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/fc2LDg3yGTE/">Graphtheoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (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 : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (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/fc2LDg3yGTE/" 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/fc2LDg3yGTE/">Graphtheoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 1416, 2001 ; proceedings, Andreas Brandstädt, Van Bang Le (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>