LEADER 06649nam 22007575 450 001 9910143884803321 005 20200706014153.0 010 $a3-540-36379-3 024 7 $a10.1007/3-540-36379-3 035 $a(CKB)1000000000211908 035 $a(SSID)ssj0000323620 035 $a(PQKBManifestationID)11246658 035 $a(PQKBTitleCode)TC0000323620 035 $a(PQKBWorkID)10299307 035 $a(PQKB)10301265 035 $a(DE-He213)978-3-540-36379-8 035 $a(MiAaPQ)EBC3071640 035 $a(PPN)155225766 035 $a(EXLCZ)991000000000211908 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science $e28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers /$fedited by Ludek Kucera 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XI, 422 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2573 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-00331-2 320 $aIncludes bibliographical references and index. 327 $aMaximum Cardinality Search for Computing Minimal Triangulations -- DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem -- On the Minimum Size of a Contraction-Universal Tree -- Optimal Area Algorithm for Planar Polyline Drawings -- Cycles in Generalized Networks -- New Graph Classes of Bounded Clique-Width -- More about Subcolorings -- Search in Indecomposable Graphs -- On the Complexity of (k, l)-Graph Sandwich Problems -- Algorithms and Models for the On-Line Vertex-Covering -- Weighted Node Coloring: When Stable Sets Are Expensive -- The Complexity of Restrictive H-Coloring -- A New 3-Color Criterion for Planar Graphs -- An Additive Stretched Routing Scheme for Chordal Graphs -- Complexity of Pattern Coloring of Cycle Systems -- Safe Reduction Rules for Weighted Treewidth -- Graph Separator Algorithms: A Refined Analysis -- Generalized H-Coloring and H-Covering of Trees -- The Complexity of Approximating the Oriented Diameter of Chordal Graphs -- Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies -- Completely Independent Spanning Trees in Maximal Planar Graphs -- Facets of the Directed Acyclic Graph Layering Polytope -- Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP -- Complexity of Some Infinite Games Played on Finite Graphs -- New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs -- A Multi-scale Algorithm for the Linear Arrangement Problem -- On the b-Chromatic Number of Graphs -- Budgeted Maximum Graph Coverage -- Online Call Admission in Optical Networks with Larger Demands -- The Forest Wrapping Problem on Outerplanar Graphs -- On the Recognition of P 4 -Comparability Graphs -- Bend-Minimum Orthogonal Drawings of Plane 3-Graphs -- Cluster Graph Modification Problems -- Two Counterexamples in Graph Drawing -- Connected and Loosely Connected List Homomorphisms -- Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. 330 $aThe 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ´ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13?15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications.The workshop was devoted to the theoretical and practical aspects of graph concepts in computer science, and its contributed talks showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. Altogether 61 research papers were submitted and reviewed by the program committee. The program committee represented the wide scienti?c spectrum, and in a careful reviewing process with four reports per submission it selected 36papersforpresentationattheworkshop.Thereferees?commentsaswellasthe numerous fruitful discussions during the workshop have been taken into account by the authors of these conference proceedings. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2573 606 $aComputers 606 $aComputer simulation 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSimulation and Modeling$3https://scigraph.springernature.com/ontologies/product-market-codes/I19000 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aComputers. 615 0$aComputer simulation. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 14$aTheory of Computation. 615 24$aSimulation and Modeling. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aNumeric Computing. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004.0151 702 $aKucera$b Ludek$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910143884803321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA