LEADER 04705nam a22006135i 4500001 99125300892106421 005 20200704113349.0 007 cr nn 008mamaa 008 121227s1991 gw | o |||| 0|eng d 020 3-540-46310-0 024 7 10.1007/3-540-53832-1 |2doi 035 (CKB)1000000000233623 035 (SSID)ssj0000323623 035 (PQKBManifestationID)11234360 035 (PQKBTitleCode)TC0000323623 035 (PQKBWorkID)10299832 035 (PQKB)10727484 035 (DE-He213)978-3-540-46310-8 035 (PPN)155189964 035 (EXLCZ)991000000000233623 041 eng 050 4 QA75.5-76.95 072 7 UY |2bicssc 072 7 UYA |2bicssc 072 7 COM014000 |2bisacsh 072 7 COM031000 |2bisacsh 082 04 004.0151 |223 111 2 International Workshop WG 245 10 Graph-Theoretic Concepts in Computer Science |h[electronic resource] : |b16th International Workshop WG '90, Berlin, Germany, June 20-22, 1990 / |cedited by Rolf H. Möhring. 250 1st ed. 1991. 264 1 Berlin, Heidelberg : |bSpringer Berlin Heidelberg : |bImprint: Springer, |c1991. 300 1 online resource (XIII, 367 p.) 336 text |btxt 337 computer |bc 338 online resource |bcr 490 1 Lecture Notes in Computer Science, |x0302-9743 ; |v484 500 Bibliographic Level Mode of Issuance: Monograph 546 English 505 0 Optimal 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. 520 This 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. 650 0 Computers. 650 0 Algorithms. 650 0 Combinatorics. 650 0 Data structures (Computer science). 650 0 Logic design. 650 14 Theory of Computation. |0https://scigraph.springernature.com/ontologies/product-market-codes/I16005 650 24 Algorithm Analysis and Problem Complexity. |0https://scigraph.springernature.com/ontologies/product-market-codes/I16021 650 24 Combinatorics. |0https://scigraph.springernature.com/ontologies/product-market-codes/M29010 650 24 Computation by Abstract Devices. |0https://scigraph.springernature.com/ontologies/product-market-codes/I16013 650 24 Data Structures. |0https://scigraph.springernature.com/ontologies/product-market-codes/I15017 650 24 Logic Design. |0https://scigraph.springernature.com/ontologies/product-market-codes/I12050 776 |z3-540-53832-1 700 1 Möhring, Rolf H. |eeditor. |4edt |4http://id.loc.gov/vocabulary/relators/edt 830 0 Lecture Notes in Computer Science, |x0302-9743 ; |v484 906 BOOK