Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/000921776/catalog> ?p ?o. }

• catalog contributor b1487374.
• catalog created "1981.".
• catalog date "1981".
• catalog date "1981.".
• catalog dateCopyrighted "1981.".
• catalog description "Includes bibliographies.".
• catalog description "J. Perl, J. Ebert -- A bird's-eye view to path problems / B. Mahr -- The Chinese postman problem for mixed graphs / P. Brucker -- Alternating cycle covers and paths / O. Vornberger -- Generating all planar 0-, 1-, 2-, 3-connected graphs / P. Läuchli -- Optimal (s, t)-cuts / H. Hamacher -- F-factors, perfect matchings and related concepts / U. Derigs.".
• catalog description "The post-office problem and related questions / H. Maurer -- Series of graphs generated by rational machines / H. Nishio -- On linearizing graphs / K.-U. Witt -- Set-theoretic concepts in programming languages and their implementation / J.J. Schneider -- Graph rewriting automatic, machine-independent program optimization / M. Nagl -- Properties of ordered graph grammars / H.J. Ludwigs -- The power of a one-dimensional vector of processors / J.L. Bently, Th. Ottmann -- A new data structure for representing sorted lists / K. Mehlhorn / On the use of some almost sure graph properties / G. Tinhofer -- On a generalization of heaps / H. Noltemeier -- Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs / M. Schnitzler -- Issues in the study of graph embeddings / A.L. Rosenberg -- Schema hypergraphs: a formalism to investigate logical data base design / C. Batini, A. D'Arti --".
• catalog description "The use of transitively irreducible kernels of full families of functional dependencies in logical data base design / P. Kandzia, M. Mangelmann -- Graph algorithms for the synthesis and manipulation of data base schemes / G. Ausiello, A. D'Atri, D. Saccà -- The analysis of search trees: a survey / Th. Ottmann, H.-W. Six, D. Wood -- A framework for data structures / H.-W. Six -- Investigating programs in terms of partial graphs / G. Schmidt -- An observation concerning the complexity of problems with few solutions and its application to cryptography / S. Even, Y. Yacobi -- Bounding the bandwidth of np-complete problems / B. Monien, I.H. Sudborough -- The complexity of path problems in graphs and path systems of bounded bandwidth / I.H. Sudborough -- A comparision [sic] between petri-nets and graph grammars / H.-J Kreowski -- A graph grammar representation of nonsequential processes / W. Reisig -- Reachability homomorphisms on nets /".
• catalog extent "x, 403 p. :".
• catalog identifier "0387102914".
• catalog isPartOf "Lecture notes in computer science ; 100".
• catalog issued "1981".
• catalog issued "1981.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer-Verlag,".
• catalog subject "Electronic data processing Congresses.".
• catalog subject "Graph theory Congresses.".
• catalog subject "QA166 .G74".
• catalog tableOfContents "J. Perl, J. Ebert -- A bird's-eye view to path problems / B. Mahr -- The Chinese postman problem for mixed graphs / P. Brucker -- Alternating cycle covers and paths / O. Vornberger -- Generating all planar 0-, 1-, 2-, 3-connected graphs / P. Läuchli -- Optimal (s, t)-cuts / H. Hamacher -- F-factors, perfect matchings and related concepts / U. Derigs.".
• catalog tableOfContents "The post-office problem and related questions / H. Maurer -- Series of graphs generated by rational machines / H. Nishio -- On linearizing graphs / K.-U. Witt -- Set-theoretic concepts in programming languages and their implementation / J.J. Schneider -- Graph rewriting automatic, machine-independent program optimization / M. Nagl -- Properties of ordered graph grammars / H.J. Ludwigs -- The power of a one-dimensional vector of processors / J.L. Bently, Th. Ottmann -- A new data structure for representing sorted lists / K. Mehlhorn / On the use of some almost sure graph properties / G. Tinhofer -- On a generalization of heaps / H. Noltemeier -- Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs / M. Schnitzler -- Issues in the study of graph embeddings / A.L. Rosenberg -- Schema hypergraphs: a formalism to investigate logical data base design / C. Batini, A. D'Arti --".
• catalog tableOfContents "The use of transitively irreducible kernels of full families of functional dependencies in logical data base design / P. Kandzia, M. Mangelmann -- Graph algorithms for the synthesis and manipulation of data base schemes / G. Ausiello, A. D'Atri, D. Saccà -- The analysis of search trees: a survey / Th. Ottmann, H.-W. Six, D. Wood -- A framework for data structures / H.-W. Six -- Investigating programs in terms of partial graphs / G. Schmidt -- An observation concerning the complexity of problems with few solutions and its application to cryptography / S. Even, Y. Yacobi -- Bounding the bandwidth of np-complete problems / B. Monien, I.H. Sudborough -- The complexity of path problems in graphs and path systems of bounded bandwidth / I.H. Sudborough -- A comparision [sic] between petri-nets and graph grammars / H.-J Kreowski -- A graph grammar representation of nonsequential processes / W. Reisig -- Reachability homomorphisms on nets /".
• catalog title "Graphtheoretic concepts in computer science : proceedings of the international workshop WG 80, Bad Honnef, June 15-18, 1980 / edited by Hartmut Noltemeier.".
• catalog type "Conference proceedings. fast".
• catalog type "text".