LEADER 05206nam 22007455 450 001 996465640103316 005 20200705034326.0 010 $a3-540-46735-1 024 7 $a10.1007/3-540-55121-2 035 $a(CKB)1000000000233774 035 $a(SSID)ssj0000323624 035 $a(PQKBManifestationID)11258078 035 $a(PQKBTitleCode)TC0000323624 035 $a(PQKBWorkID)10299619 035 $a(PQKB)10816934 035 $a(DE-He213)978-3-540-46735-9 035 $a(PPN)155165232 035 $a(EXLCZ)991000000000233774 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science$b[electronic resource] $e17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings /$fedited by Gunther Schmidt, Rudolf Berghammer 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (VIII, 256 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v570 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55121-2 327 $aApproximating treewidth, pathwidth, and minimum elimination tree height -- Monadic second-order evaluations on tree-decomposable graphs -- Optimal embedding of complete binary trees into lines and grids -- Graph rewriting systems and their application to network reliability analysis -- Nondeterministic control structures for graph rewriting systems -- A language for generic graph-transformations -- Attributed elementary programmed graph grammars -- The complexity of approximating the class Steiner tree problem -- On complexity of some chain and antichain partition problems -- Tight bounds for the rectangular art gallery problem -- Voronoi diagrams of moving points in the plane -- Using maximal independent sets to solve problems in parallel -- Fast parallel algorithms for coloring random graphs -- Optimal vertex ordering of a graph and its application to symmetry detection -- Edge separators for graphs of bounded genus with applications -- Line digraph iterations and the spread concept?with application to graph theory, fault tolerance, and routing -- A generalized encryption scheme based on random graphs -- Dynamic algorithms for shortest paths in planar graphs -- Complete problems for logspace involving lexicographic first paths in graphs -- A new upper bound on the complexity of the all pairs shortest path problem -- On the crossing number of the hypercube and the cube connected cycles -- Logic arrays for interval indicator functions -- On the broadcast time of the butterfly network -- On disjoint cycles -- Short disjoint cycles in cubic bridgeless graphs. 330 $aThis volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: tree-related problems, graph grammarsand rewriting, complexity, computational geometry, parallel algorithms, vertex orderings, path-oriented algorithms, applications to VLSI, and disjoint cycle problems. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v570 606 $aComputer science?Mathematics 606 $aAlgorithms 606 $aCombinatorics 606 $aComputers 606 $aData structures (Computer science) 606 $aLogic design 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aLogic Design$3https://scigraph.springernature.com/ontologies/product-market-codes/I12050 615 0$aComputer science?Mathematics. 615 0$aAlgorithms. 615 0$aCombinatorics. 615 0$aComputers. 615 0$aData structures (Computer science). 615 0$aLogic design. 615 14$aMathematics of Computing. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aCombinatorics. 615 24$aComputation by Abstract Devices. 615 24$aData Structures. 615 24$aLogic Design. 676 $a004.0151 702 $aSchmidt$b Gunther$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aBerghammer$b Rudolf$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465640103316 996 $aGraph-Theoretic Concepts in Computer Science$9772292 997 $aUNISA