{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:24:29Z","timestamp":1725625469896},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540097730"},{"type":"electronic","value":"9783642674853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/978-3-642-67485-3_9","type":"book-chapter","created":{"date-parts":[[2011,10,26]],"date-time":"2011-10-26T21:50:01Z","timestamp":1319665801000},"page":"170-180","source":"Crossref","is-referenced-by-count":2,"title":["Graphentheoretische Modelle und Methoden"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Noltemeier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Adelson-Velskij, G.M. und E.M. Landis Ein Algorithmus zur Informationsorganisation (russisch), Doklady Akad. Nauk, SSSR 146, 1962"},{"key":"9_CR2","unstructured":"Aho, A.V., Hopcroft, J.E. und J.D. Ullmann The design and analysis of computer algorithms, Addison Wesley, 1974"},{"key":"9_CR3","unstructured":"Barth, H. Ein graphentheoretisches Konzept zur Beschreibung von Methodenund Modellbanksystemen, in [33]"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Basili, V.R., Rheinboldt, W.R. und C.K. Mesztenyi On a programming language for graph algorithms, BIT, 12, 1972","DOI":"10.1007\/BF01932817"},{"key":"9_CR5","volume-title":"Lecture Notes in Computer Science","author":"R Bayer","year":"1976","unstructured":"Bayer, R. On the Intergrity of Data Bases and Resource Locking, in: Lecture Notes in Computer Science, 39, Springer, Heidelberg, 1976"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bayer, R. und E. McCreight Organization and Maintenance of Large Ordered Indexes, Acta Informatica, 1, 1972","DOI":"10.1007\/BF00288683"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bentley, J.C. Multidimensional binary search trees used for associative searching, CACM, 18, 1975","DOI":"10.1145\/361002.361007"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Bentley, J.L. und H.A. Maurer Efficient worst-case data structures for range searching, Report 1978","DOI":"10.2172\/1447024"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Bentley, J.L. und J.H. Friedman Algorithms and Data Structures for Range Queries, Report 1978","DOI":"10.2172\/1447024"},{"key":"9_CR10","volume-title":"The Hypergraph-Based Data Structure: A new approach to data bases modlling and application","author":"F Bouill\u00e9","year":"1977","unstructured":"Bouill\u00e9, F. The Hypergraph-Based Data Structure: A new approach to data bases modlling and application; GI-Jahrestagung, Erlangen, 1977"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Codasyl Systems Comittee Feature Analyses of Generalized Data Base Management Systems, 1971","DOI":"10.1145\/362588.362590"},{"key":"9_CR12","first-page":"6","volume":"13","author":"EF Codd","year":"1970","unstructured":"Codd, E.F. A Relational Model for Large Shared Data Banks, CACM, 13, 6, June 1970","journal-title":"CACM"},{"key":"9_CR13","first-page":"5","volume":"13","author":"E Crespi-Rheghizzi","year":"1970","unstructured":"Crespi-Rheghizzi, E. und R. Morpurgo A language for treating graphs, CACM, 13, 5, 1970","journal-title":"CACM"},{"key":"9_CR14","unstructured":"Culik II, K. und H.A. Maurer Linearizing Selector \u2014 Graphs and Application therof Angewandte Informatik, 9, 1977"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Deppe, M.E. und J.P. Fry Distributed data bases \u2014 a summary of research, Computer Networks, 1, 1976","DOI":"10.1016\/0376-5075(76)90018-0"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Domschke, W. Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte-Ein \u00fcberblick; ZOR, 19, 1975","DOI":"10.1007\/BF01963926"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Earley, J. Toward an Understanding of Data Structures CACM, 14, 1971","DOI":"10.1145\/362759.362764"},{"key":"9_CR18","unstructured":"Ehrich, H.D. und V.G. Lohberger Parametric specification of abstract data types, parameter substitution, and graph replacements; in [35]"},{"key":"9_CR19","unstructured":"Ehrig, H. und H.J. Kreowski Algrbraic theory of graph grammarsapplied to consistency and synchronization in data base systems; in [35]"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M. und H.J. Schneider Graph-grammars \u2014 an algebraic approach, Proc. Conf. Switch. Autom. Theory, 1973","DOI":"10.1109\/SWAT.1973.11"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Finkel, R.A. und J.L. Bentley Quad trees, a data structure for retrieval on composite keys, Acta Informatica, 4, 1974","DOI":"10.1007\/BF00288933"},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin, E. Trie Memory, CACM, 3, 9, Sept., 1960","journal-title":"CACM"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Friedman, J.H., Bentley, J.L. und A.R. Finkel An algorithm for finding best matches in logarithmic expected time; ACM Transactions on Math. Software, 3, 1977","DOI":"10.1145\/355744.355745"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Guttag, T. Abstract Data Types and the Development of Data Structures CACM, 20, 1977","DOI":"10.1145\/359605.359618"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"King, C.A. A graph theoretic programming language; in: Graph Theory and Computing (ed.: Read), Academic Press, 1972","DOI":"10.1016\/B978-1-4832-3187-7.50011-8"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Liskov, B.H. und S.N. Zilles Specification Techniques for Data Abstractions, IEEE Trans. on Software Engineering, SE-1, 1975","DOI":"10.1145\/800027.808426"},{"key":"9_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-67053-4","volume-title":"Rechnergest\u00fctzte Informationssysteme","author":"PC Lockemann","year":"1978","unstructured":"Lockemann, P.C. und H.C. Mayr Rechnergest\u00fctzte Informationssysteme, Springer, Berlin-Heidelberg-New York, 1978"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Majster, M. Extended Directed Graphs, a Formalism for Structures Data and Data Strutures, Acta Informatica, 8, 1977","DOI":"10.1007\/BF00276183"},{"key":"9_CR29","unstructured":"Maurer, H.A., Th. Ottmann und H.W. Six Manipulation of number sets using balanced trees; in: [41]"},{"key":"9_CR30","unstructured":"Maurer, H.A. und Th. Ottmann Manipulating sets of points \u2014 a survey, in: [35]"},{"key":"9_CR31","volume-title":"Effiziente Algorithmen","author":"K Mehlhorn","year":"1977","unstructured":"Mehlhorn, K. Effiziente Algorithmen Teubner Studienb\u00fccher, Stuttgart, 1977"},{"key":"9_CR32","unstructured":"Mehlhorn, K. On Digital Tree Searching Lille, 1978"},{"volume-title":"Datenstrukturen, Graphen, Algorithmen","year":"1978","key":"9_CR33","unstructured":"M\u00fchlbacher, J. (ed.) Datenstrukturen, Graphen, Algorithmen, Carl-Hanser-Verlag, M\u00fcnchen, 1978"},{"key":"9_CR34","volume-title":"Graphersetzungssysteme: Theorie, Anwendungen, Implementierungen","author":"M Nagl","year":"1978","unstructured":"Nagl, M. Graphersetzungssysteme: Theorie, Anwendungen, Implementierungen; Habilitationsschrift, Erlangen, 1978"},{"volume-title":"Graphs, Data Structures, Algorithms","year":"1979","key":"9_CR35","unstructured":"Nagl, M. und H.J. Schneider (ed.) Graphs, Data Structures, Algorithms, Carl-Hanser-Verlag, M\u00fcnchen, 1979"},{"key":"9_CR36","unstructured":"Nagl, M. und H. Zischler A dialog system for the graphical representation of graphs; in: [35]"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Noe, J.D. und G.J. Nutt Macro E-Nets for Representation of Parallel Systems, IEEE Trans. on Comp. Systems C-22, 1973","DOI":"10.1109\/TC.1973.5009150"},{"key":"9_CR38","volume-title":"Graphentheorie mit Algorithmen und Anwendungen","author":"H Noltemeier","year":"1976","unstructured":"Noltemeier, H. Graphentheorie mit Algorithmen und Anwendungen, de Gruyter, Berlin, 1976"},{"key":"9_CR39","unstructured":"Noltemeier, H. Transitive Irreduzibilit\u00e4t, in [33]"},{"key":"9_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-41562-7","volume-title":"Computergest\u00fctzte Planungssysteme","author":"H Noltemeier","year":"1976","unstructured":"Noltemeier, H. Verkn\u00fcpfungsprobleme:Modelle-Methoden-Daten, in: Computergest\u00fctzte Planungssysteme, Physica, W\u00fcrzburg, 1976"},{"volume-title":"Graphen, Algorithmen, Datenstrukturen","year":"1976","key":"9_CR41","unstructured":"Noltemeier, H. (ed.) Graphen, Algorithmen, Datenstrukturen Carl-Hanser-Verlag, M\u00fcnchen, 1976"},{"key":"9_CR42","unstructured":"Ottmann, Th., Six, H.W. und D. Wood New Results in Balanced Search Trees; in: [33]"},{"key":"9_CR43","unstructured":"Petri, C.A. Concepts of Net Theory, Proc. Math. Foundations of Comp. Science, Hohe Tatra, 1973"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Pratt, T.W. und D.P. Friedman A language extension for graphs processing and its formal semantics, CACM, 14, 1971","DOI":"10.1145\/362619.362627"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Rosen, B. Deviring Graphs from Graphs by Applying a Production, Acta Informatica, 4, 1975","DOI":"10.1007\/BF00289616"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Rosenberg, A.L. Data Graphs and Adressing Schemes, JCSS, 5, 1971","DOI":"10.1016\/S0022-0000(71)80034-X"},{"key":"9_CR47","volume-title":"Datenbanksysteme: Konzepte und Modelle","author":"W Schlageter","year":"1977","unstructured":"Schlageter, W. und W. Stucky Datenbanksysteme: Konzepte und Modelle, Teubner Studienb\u00fccher, Stuttgart, 1977"},{"key":"9_CR48","unstructured":"Schneider, H.J. Conceptual data base description using graph-grammars; in [41]"},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Schneider, H.J. und H. Ehrig Grammars on Partial Graphs, Acta Informatica, 6, 1976","DOI":"10.1007\/BF00288659"},{"key":"9_CR50","unstructured":"Six, H.W. Ein Modell zur Beschreibung von Datenstrukturen und deren Realisationen, Dissertation, Karlsruhe, 1978"},{"key":"9_CR51","unstructured":"Weber, D. Transformation programs for data graphs, a tool for specifying, verifying and implementing data types, in [35]."}],"container-title":["Informatik-Fachberichte","Formale Modelle f\u00fcr Informationssysteme"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-67485-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T04:34:58Z","timestamp":1713069298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-67485-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540097730","9783642674853"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-67485-3_9","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1979]]}}}