05295nam 22007815 450 991076757790332120200705081344.03-540-45477-210.1007/3-540-45477-2(CKB)1000000000211601(SSID)ssj0000323619(PQKBManifestationID)11247885(PQKBTitleCode)TC0000323619(PQKBWorkID)10299477(PQKB)10660899(DE-He213)978-3-540-45477-9(MiAaPQ)EBC3072825(PPN)155186248(EXLCZ)99100000000021160120121227d2001 u| 0engurnn|008mamaatxtccrGraph-Theoretic Concepts in Computer Science 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings /edited by Andreas Brandstädt, Van Bang Le1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (X, 334 p.) Lecture Notes in Computer Science,0302-9743 ;2204Bibliographic Level Mode of Issuance: Monograph3-540-42707-4 Includes bibliographical references at the end of each chapters and index.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.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.Lecture Notes in Computer Science,0302-9743 ;2204Computer programmingComputersData structures (Computer science)AlgorithmsComputer science—MathematicsProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Data Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Computer programming.Computers.Data structures (Computer science).Algorithms.Computer science—Mathematics.Programming Techniques.Theory of Computation.Data Structures and Information Theory.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Data Structures.004.015115Brandstädt Andreasedthttp://id.loc.gov/vocabulary/relators/edtLe Van Bangedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910767577903321Graph-Theoretic Concepts in Computer Science2569248UNINA