LEADER 04653nam 22006255 450 001 996465674403316 005 20200705030153.0 010 $a3-540-47415-3 024 7 $a10.1007/3-540-17218-1 035 $a(CKB)1000000000230581 035 $a(SSID)ssj0000323626 035 $a(PQKBManifestationID)11247886 035 $a(PQKBTitleCode)TC0000323626 035 $a(PQKBWorkID)10300705 035 $a(PQKB)10092084 035 $a(DE-He213)978-3-540-47415-9 035 $a(PPN)155171151 035 $a(EXLCZ)991000000000230581 100 $a20121227d1987 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] $eInternational Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986, Proceedings /$fedited by Gottfried Tinhofer, Gunther Schmidt 205 $a1st ed. 1987. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1987. 215 $a1 online resource (X, 314 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v246 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-17218-1 327 $aA simple linear-time algorithm to recognize interval graphs -- On approximation algorithms for Steiner's problem in graphs -- Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity -- ADA concurrency specified by graph grammars -- Cabri, an interactive system for graph manipulation -- An interactive graphical manipulation system for higher objects based on relational algebra -- Behaviour preserving refinements of Petri nets -- The bandwidth of planar distributive lattices -- The node visit cost of brother trees -- Searching connected components in very large grid graphs -- A simple implementation of Warshall's algorithm on a vlsi chip -- On some generalizations of outerplanar graphs: Results and open problems -- Recognizing outerplanar graphs in linear time -- Graphs and graph polynomials of interest in chemistry -- Applications of parallel scheduling to perfect graphs -- A graph-theoretic approach for designing fair distributed resource scheduling algorithms -- Improved diameter bounds for altered graphs -- Separability of sets of polygons -- Centipede graphs and visibility on a cylinder -- The diameter of connected components of random graphs -- An algorithm for testing planarity of hierarchical graphs -- EDM ? A data model for electronic CAD/CAM-applications. 330 $aGraph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their complexity is studied under various randomness assumptions. This volume contains contributions to the twelfth of a series of annual workshops designed to bring together researchers using graph-theoretic methods. Its purpose is to broadcast emerging new developments from and to a diversity of application fields. The topics covered include: Graph Grammars, Graph Manipulation, Nets, Complexity Issues, Algorithmic and Network Considerations, Outerplanar Graphs, Graph Isomorphism, Parallelism and Distributed Systems, Graphs and Geometry, Randomness Considerations, Applications in Chemistry, Specific Algorithms. N. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v246 606 $aComputers 606 $aCombinatorics 606 $aComputer communication systems 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 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 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 615 0$aComputers. 615 0$aCombinatorics. 615 0$aComputer communication systems. 615 14$aTheory of Computation. 615 24$aCombinatorics. 615 24$aComputation by Abstract Devices. 615 24$aComputer Communication Networks. 676 $a004.0151 702 $aTinhofer$b Gottfried$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSchmidt$b Gunther$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465674403316 996 $aGraph-Theoretic Concepts in Computer Science$9772292 997 $aUNISA