LEADER 04927nam 22007095 450 001 996465391303316 005 20200704113349.0 010 $a3-540-46310-0 024 7 $a10.1007/3-540-53832-1 035 $a(CKB)1000000000233623 035 $a(SSID)ssj0000323623 035 $a(PQKBManifestationID)11234360 035 $a(PQKBTitleCode)TC0000323623 035 $a(PQKBWorkID)10299832 035 $a(PQKB)10727484 035 $a(DE-He213)978-3-540-46310-8 035 $a(PPN)155189964 035 $a(EXLCZ)991000000000233623 100 $a20121227d1991 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] $e16th International Workshop WG '90, Berlin, Germany, June 20-22, 1990 /$fedited by Rolf H. Möhring 205 $a1st ed. 1991. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991. 215 $a1 online resource (XIII, 367 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v484 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-53832-1 327 $aOptimal parallel algorithms for sparse graphs -- Finding minimally weighted subgraphs -- On the complexity of some coloring games -- A generalized best-first search method in graphs -- Avoiding matrix multiplication -- Induced subraph isomorphism for cographs is NP-complete -- On feedback problems in planar digraphs -- Recognizing binary hamming graphs in O(n 2 log n) time -- Vertex-disjoint trees and boundary single-layer routing -- Bounds on the quality of approximate solutions to the group Steiner problem -- Two polynomial problems in PLA folding -- The VLSI layout problem in various embedding models -- Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems -- Deterministic message routing in faulty hypercubes -- On complexity of a message-routing strategy for multicomputer systems -- Embeddings of treelike graphs into 2-dimensional meshes -- Diagnosis of t/s-diagnosable systems -- Deciding 1-solvability of distributed task is NP-hard -- Remarks on some concurrency measures -- On the rectilinear art gallery problem algorithmic aspects -- Separation problems and circular arc systems -- Genus of orders and lattices -- Comparing the expressibility of two languages formed using NP-complete graph operators -- Decomposition of linear recursive logic programs -- On the transition graphs of automata and grammars -- Algebraic approach to graph transformation based on single pushout derivations. 330 $aThis volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. The volume is organized into sections on: - Graph algorithms and complexity, - VLSI layout, - Multiprocessor systems and concurrency, - Computational geometry, - Graphs, languages and databases, - Graph grammars. The volume contains revised versions of nearly all the papers presented at the workshop. Several papers take the form of preliminary reports on ongoing research. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v484 606 $aComputers 606 $aAlgorithms 606 $aCombinatorics 606 $aData structures (Computer science) 606 $aLogic design 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 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$aComputers. 615 0$aAlgorithms. 615 0$aCombinatorics. 615 0$aData structures (Computer science). 615 0$aLogic design. 615 14$aTheory of Computation. 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 $aMöhring$b Rolf H$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465391303316 996 $aGraph-Theoretic Concepts in Computer Science$9772292 997 $aUNISA