LEADER 05103nam 22007095 450 001 996465482803316 005 20200703051700.0 010 $a3-540-48487-6 024 7 $a10.1007/3-540-60618-1 035 $a(CKB)1000000000234379 035 $a(SSID)ssj0000323629 035 $a(PQKBManifestationID)11247954 035 $a(PQKBTitleCode)TC0000323629 035 $a(PQKBWorkID)10318928 035 $a(PQKB)10553333 035 $a(DE-He213)978-3-540-48487-5 035 $a(PPN)155163620 035 $a(EXLCZ)991000000000234379 100 $a20121227d1995 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] $e21st International Workshop, WG '95, Aachen, Germany, June 20 - 22, 1995. Proceedings /$fedited by Manfred Nagl 205 $a1st ed. 1995. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995. 215 $a1 online resource (XII, 411 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1017 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-60618-1 327 $aVC-dimensions for graphs (extended abstract) -- Finding and counting small induced subgraphs efficiently -- On the isomorphism of graphs with few P4s -- A dynamic algorithm for line graph recognition -- Incremental hive graph -- Planarization of graphs embedded on surfaces -- Complexity and approximability of certain bicriteria location problems -- On termination of graph rewriting -- A uniform approach to graph rewriting: The pullback approach -- Visualizing two- and three-dimensional models of meristematic growth -- Graph-theoretical methods to construct entity-relationship databases -- An approximation algorithm for 3-Colourability -- The malleability of TSP 2Opt -- Non-oblivious local search for graph and hypergraph coloring problems -- On Interval Routing Schemes and treewidth -- Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs -- Hot-potato routing on multi-dimensional tori -- On devising Boolean Routing schemes -- Toward a general theory of unicast-based multicast communication -- Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes -- Searching for faulty leaves in binary trees -- NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems -- Efficient parallel modular decomposition (extended abstract) -- Modular decomposition of hypergraphs -- Partition coefficients of acyclic graphs -- Sub-cubic cost algorithms for the all pairs shortest path problem -- Diametral path graphs -- Chordal graphs and their clique graphs -- A compact data structure and parallel algorithms for permutation graphs -- Homogeneously orderable graphs and the Steiner tree problem. 330 $aThis book constitutes the refereed proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science, WG '95, held in Aachen, Germany, in June 1995. The WG workshop series contributes to integration in computer science by applying graph theoretical concepts in various areas as well as by taking up problems from practical applications and treating them theoretically. The book presents 30 carefully refereed revised papers selected from 52 submissions and reflects current activities in the field of computer science oriented graph theory, its computational aspects and its application. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1017 606 $aGraph theory 606 $aComputers 606 $aAlgorithms 606 $aCombinatorics 606 $aComputer logic 606 $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020 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 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 615 0$aGraph theory. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aCombinatorics. 615 0$aComputer logic. 615 14$aGraph Theory. 615 24$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aCombinatorics. 615 24$aComputation by Abstract Devices. 615 24$aLogics and Meanings of Programs. 676 $a511.5 702 $aNagl$b Manfred$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465482803316 996 $aGraph-Theoretic Concepts in Computer Science$9772292 997 $aUNISA