05363nam 22007335 450 99646584530331620200703015318.03-540-46950-810.1007/3-540-52292-1(CKB)1000000000233499(SSID)ssj0000323622(PQKBManifestationID)11240556(PQKBTitleCode)TC0000323622(PQKBWorkID)10318927(PQKB)11206417(DE-He213)978-3-540-46950-6(PPN)155189999(EXLCZ)99100000000023349920121227d1990 u| 0engurnn|008mamaatxtccrGraph-Theoretic Concepts in Computer Science[electronic resource] 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings /edited by Manfred Nagl1st ed. 1990.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1990.1 online resource (XI, 377 p.)Lecture Notes in Computer Science,0302-9743 ;411Bibliographic Level Mode of Issuance: Monograph3-540-52292-1 Disjoint 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.The 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.Lecture Notes in Computer Science,0302-9743 ;411Data structures (Computer science)Programming languages (Electronic computers)Software engineeringCombinatoricsAlgorithmsComputersData Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Data structures (Computer science).Programming languages (Electronic computers).Software engineering.Combinatorics.Algorithms.Computers.Data Structures and Information Theory.Programming Languages, Compilers, Interpreters.Software Engineering/Programming and Operating Systems.Combinatorics.Algorithm Analysis and Problem Complexity.Computation by Abstract Devices.005.74Nagl Manfrededthttp://id.loc.gov/vocabulary/relators/edtBOOK996465845303316Graph-Theoretic Concepts in Computer Science772292UNISA