LEADER 06587nam 22007815 450 001 9910143616203321 005 20200701050817.0 010 $a3-540-40064-8 024 7 $a10.1007/3-540-40064-8 035 $a(CKB)1000000000211329 035 $a(SSID)ssj0000323617 035 $a(PQKBManifestationID)11242477 035 $a(PQKBTitleCode)TC0000323617 035 $a(PQKBWorkID)10303823 035 $a(PQKB)10946091 035 $a(DE-He213)978-3-540-40064-6 035 $a(MiAaPQ)EBC3072478 035 $a(PPN)155166859 035 $a(EXLCZ)991000000000211329 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science $e26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings /$fedited by Ulrik Brandes, Dorothea Wagner 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (X, 313 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1928 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-41183-6 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aOn the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation) -- n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture) -- Approximating Call-Scheduling Makespan in All-Optical Networks -- New Spectral Lower Bounds on the Bisection Width of Graphs -- Traversing Directed Eulerian Mazes (Extended Abstract) -- On the Space and Access Complexity of Computation DAGs -- Approximating the Treewidth of AT-Free Graphs -- Split-Perfect Graphs: Characterizations and Algorithmic Use -- Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs -- Networks with Small Stretch Number (Extended Abstract) -- Efficient Dispersion Algorithms for Geometric Intersection Graphs -- Optimizing Cost Flows by Modifying Arc Costs and Capacities -- Update Networks and Their Routing Strategies -- Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults -- Diameter of the Knödel Graph -- On the Domination Search Number -- Efficient Communication in Unknown Networks -- Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract) -- The Tree-Width of Clique-Width Bounded Graphs without K n,n -- Tree Spanners for Subgraphs and Related Tree Covering Problems -- Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization -- The Expressive Power and Complexity of Dynamic Process Graphs -- Bandwidth of Split and Circular Permutation Graphs -- Recognizing Graphs without Asteroidal Triples (Extended Abstract) -- Budget Constrained Minimum Cost Connected Medians -- Coloring Mixed Hypertrees -- A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs -- Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables. 330 $aThe 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) was held at Waldhaus Jakob, in Konstanz, Germany, on 15{ 17 June 2000. It was organized by the Algorithms and Data Structures Group of the Department of Computer and Information Science, University of K- stanz, and sponsored by Deutsche Forschungsgemeinschaft (DFG) and Univ- sit¨atsgesellschaft Konstanz. The workshop aims 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 goal is to present recent research results and to identify and explore directions for future research. The workshop looks back on a remarkable tradition of more than a quarter of a century. Previous Workshops have been organized in various places in Europe, and submissions come from all over the world. This year, 57 attendees from 13 di erent countries gathered in the relaxing atmosphere of Lake Constance, also known as the Bodensee. Out of 51 submis- ons, the program committee carefully selected 26 papers for presentation at the workshop. This selection re?ects current research directions, among them graph and network algorithms and their complexity, algorithms for special graph cl- ses, communication networks, and distributed algorithms. The present volume contains these papers together with the survey presented in an invited lecture by Ingo Wegener (University of Dortmund) and an extended abstract of the invited lecture given by Emo Welzl (ETH Zuric ¨ h). 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1928 606 $aComputer programming 606 $aComputers 606 $aData structures (Computer science) 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aComputer programming. 615 0$aComputers. 615 0$aData structures (Computer science). 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 14$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aData Structures and Information Theory. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Structures. 676 $a511.5 702 $aBrandes$b Ulrik$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWagner$b Dorothea$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143616203321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA