Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008888863/catalog> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- catalog abstract "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.".
- catalog alternative "WG 2001".
- catalog contributor b12478277.
- catalog contributor b12478278.
- catalog contributor b12478279.
- catalog created "c2001.".
- catalog date "2001".
- catalog date "c2001.".
- catalog dateCopyrighted "c2001.".
- catalog description "Includes bibliographical references and index.".
- catalog description "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.".
- catalog description "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.".
- catalog extent "x, 327 p. :".
- catalog identifier "3540427074 (pbk.)".
- catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 2204".
- catalog issued "2001".
- catalog issued "c2001.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "Combinatorics.".
- catalog subject "Computational complexity.".
- catalog subject "Computer graphics.".
- catalog subject "Computer science Congresses.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Data structures (Computer science).".
- catalog subject "Graph theory Congresses.".
- catalog subject "Graph theory Data processing Congresses.".
- catalog tableOfContents "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.".
- catalog title "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.).".
- catalog title "WG 2001".
- catalog type "text".