05206nam 22007455 450 99646564010331620200705034326.03-540-46735-110.1007/3-540-55121-2(CKB)1000000000233774(SSID)ssj0000323624(PQKBManifestationID)11258078(PQKBTitleCode)TC0000323624(PQKBWorkID)10299619(PQKB)10816934(DE-He213)978-3-540-46735-9(PPN)155165232(EXLCZ)99100000000023377420121227d1992 u| 0engurnn|008mamaatxtccrGraph-Theoretic Concepts in Computer Science[electronic resource] 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings /edited by Gunther Schmidt, Rudolf Berghammer1st ed. 1992.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1992.1 online resource (VIII, 256 p.) Lecture Notes in Computer Science,0302-9743 ;570Bibliographic Level Mode of Issuance: Monograph3-540-55121-2 Approximating 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.This 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.Lecture Notes in Computer Science,0302-9743 ;570Computer science—MathematicsAlgorithmsCombinatoricsComputersData structures (Computer science)Logic designMathematics of Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I17001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Logic Designhttps://scigraph.springernature.com/ontologies/product-market-codes/I12050Computer science—Mathematics.Algorithms.Combinatorics.Computers.Data structures (Computer science).Logic design.Mathematics of Computing.Algorithm Analysis and Problem Complexity.Combinatorics.Computation by Abstract Devices.Data Structures.Logic Design.004.0151Schmidt Guntheredthttp://id.loc.gov/vocabulary/relators/edtBerghammer Rudolfedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465640103316Graph-Theoretic Concepts in Computer Science772292UNISA