LEADER 05363nam 22007335 450 001 996465845303316 005 20200703015318.0 010 $a3-540-46950-8 024 7 $a10.1007/3-540-52292-1 035 $a(CKB)1000000000233499 035 $a(SSID)ssj0000323622 035 $a(PQKBManifestationID)11240556 035 $a(PQKBTitleCode)TC0000323622 035 $a(PQKBWorkID)10318927 035 $a(PQKB)11206417 035 $a(DE-He213)978-3-540-46950-6 035 $a(PPN)155189999 035 $a(EXLCZ)991000000000233499 100 $a20121227d1990 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] $e15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings /$fedited by Manfred Nagl 205 $a1st ed. 1990. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1990. 215 $a1 online resource (XI, 377 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v411 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-52292-1 327 $aDisjoint paths in the hypercube -- Time bounds for broadcasting in bounded degree graphs -- t/s-Diagnosable systems: A characterization and diagnosis algorithm -- Toward a complete representation of graphoids in graphs ? Abridged Version -- CADULA ? A graph-based model for monitoring CAD-processes -- On hyperedge replacement and BNLC graph grammars -- Graph rewriting systems with priorities -- Filtering hyperedge-replacement languages through compatible properties -- Describing distributed systems by categorical graph grammars -- A parser for context free plex grammars -- to PROGRESS, an attribute graph grammar based specification language -- On the complexity of optimal drawings of graphs -- Bounds to the page number of partially ordered sets -- Beyond Steiner's problem: A VLSI oriented generalization -- A fast sequential and parallel algorithm for the computation of the k-closure of a graph -- On feedback problems in digraphs -- Improved self-reduction algorithms for graphs with bounded treewidth -- Finding a minimal transitive reduction in a strongly connected digraph within linear time -- Paging binary trees with external balancing -- The complexity of graph problems for succinctly represented graphs -- An O(n log n) algorithm for 1-D tile compaction -- Weighted parallel triangulation of simple polygons -- Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry -- k ? Nearest ? Neighbor Voronoi diagrams for sets of convex polygons, line segments and points -- Finding squares and rectangles in sets of points -- Combinatorial properties of abstract Voronoi diagrams. 330 $aThe aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Commonalities between various fields of specialization in computer science may be detected by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. Applications dealt with in this volume include the use of graph-theoretic concepts in distributed and parallel computation, VLSI, CAD, software engineering, computer graphics, data structures, and computational geometry. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v411 606 $aData structures (Computer science) 606 $aProgramming languages (Electronic computers) 606 $aSoftware engineering 606 $aCombinatorics 606 $aAlgorithms 606 $aComputers 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 615 0$aData structures (Computer science). 615 0$aProgramming languages (Electronic computers). 615 0$aSoftware engineering. 615 0$aCombinatorics. 615 0$aAlgorithms. 615 0$aComputers. 615 14$aData Structures and Information Theory. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aCombinatorics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 676 $a005.74 702 $aNagl$b Manfred$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465845303316 996 $aGraph-Theoretic Concepts in Computer Science$9772292 997 $aUNISA