LEADER 05291nam 22007095 450 001 996465930103316 005 20200703041314.0 010 $a3-540-49183-X 024 7 $a10.1007/3-540-59071-4 035 $a(CKB)1000000000548831 035 $a(SSID)ssj0000323615 035 $a(PQKBManifestationID)11227190 035 $a(PQKBTitleCode)TC0000323615 035 $a(PQKBWorkID)10300342 035 $a(PQKB)10637116 035 $a(DE-He213)978-3-540-49183-5 035 $a(PPN)155188518 035 $a(EXLCZ)991000000000548831 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] $e20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings /$fedited by Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer 205 $a1st ed. 1995. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995. 215 $a1 online resource (XI, 425 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v903 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-59071-4 327 $aDomino treewidth -- A lower bound for treewidth and its consequences -- Tree-width and path-width of comparability graphs of interval orders -- A declarative approach to graph based modeling -- Multilevel graph grammars -- The algorithmic use of hypertree structure and maximum neighbourhood orderings -- On domination elimination orderings and domination graphs -- Complexity of graph covering problems -- Dominoes -- GLB-closures in directed acyclic graphs and their applications -- Minimum vertex cover, distributed decision-making, and communication complexity -- Cartesian products of graphs as spanning subgraphs of de Bruijn graphs -- Specification of graph translators with triple graph grammars -- Using programmed graph rewriting for the formal specification of a configuration management system -- Exponential time analysis of confluent and boundary eNCE graph languages -- Time-optimal tree computations on sparse meshes -- Prefix graphs and their applications -- The complexity of broadcasting in planar and decomposable graphs -- The maximal f-dependent set problem for planar graphs is in NC -- On-line convex planarity testing -- Book embeddings and crossing numbers -- Measuring the distance to series-parallelity by path expressions -- Labelled trees and pairs of input-output permutations in priority queues -- Rankings of graphs -- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time -- Efficient algorithms for a mixed k-partition problem of graphs without specifying bases -- Fugitive-search games on graphs and related parameters -- New approximation results on graph matching and related problems -- New lower bounds and hierarchy results for restricted branching programs -- On-line algorithms for satisfiability problems with uncertainty -- NC algorithms for antidirected hamiltonian paths and cycles in tournaments -- Directed path graph isomorphism. 330 $aThis volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994. The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the research performed in the field. The topics addressed are graph grammars, treewidth, special graph classes, algorithms on graphs, broadcasting and architecture, planar graphs and related problems, and special graph problems. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v903 606 $aComputers 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aCombinatorics 606 $aComputer logic 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 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 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 615 0$aComputers. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aCombinatorics. 615 0$aComputer logic. 615 14$aTheory of Computation. 615 24$aDiscrete Mathematics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aCombinatorics. 615 24$aLogics and Meanings of Programs. 676 $a004.0151 702 $aMayr$b Ernst W$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSchmidt$b Gunther$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTinhofer$b Gottfried$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465930103316 996 $aGraph-Theoretic Concepts in Computer Science$9772292 997 $aUNISA