LEADER 05124nam a22006255i 4500001 99125113771706421 005 20200703041314.0 007 cr nn 008mamaa 008 121227s1995 gw | o |||| 0|eng d 020 3-540-49183-X 024 7 10.1007/3-540-59071-4 |2doi 035 (CKB)1000000000548831 035 (SSID)ssj0000323615 035 (PQKBManifestationID)11227190 035 (PQKBTitleCode)TC0000323615 035 (PQKBWorkID)10300342 035 (PQKB)10637116 035 (DE-He213)978-3-540-49183-5 035 (PPN)155188518 035 (EXLCZ)991000000000548831 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] : |b20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings / |cedited by Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer. 250 1st ed. 1995. 264 1 Berlin, Heidelberg : |bSpringer Berlin Heidelberg : |bImprint: Springer, |c1995. 300 1 online resource (XI, 425 p.) 336 text |btxt 337 computer |bc 338 online resource |bcr 490 1 Lecture Notes in Computer Science, |x0302-9743 ; |v903 500 Bibliographic Level Mode of Issuance: Monograph 546 English 505 0 Domino 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. 520 This 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. 650 0 Computers. 650 0 Discrete mathematics. 650 0 Algorithms. 650 0 Combinatorics. 650 0 Computer logic. 650 14 Theory of Computation. |0https://scigraph.springernature.com/ontologies/product-market-codes/I16005 650 24 Discrete Mathematics. |0https://scigraph.springernature.com/ontologies/product-market-codes/M29000 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 Logics and Meanings of Programs. |0https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 776 |z3-540-59071-4 700 1 Mayr, Ernst W. |eeditor. |4edt |4http://id.loc.gov/vocabulary/relators/edt 700 1 Schmidt, Gunther. |eeditor. |4edt |4http://id.loc.gov/vocabulary/relators/edt 700 1 Tinhofer, Gottfried. |eeditor. |4edt |4http://id.loc.gov/vocabulary/relators/edt 830 0 Lecture Notes in Computer Science, |x0302-9743 ; |v903 906 BOOK