{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:02:34Z","timestamp":1697904154841},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1980,5]]},"DOI":"10.1007\/bf00288768","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T01:02:08Z","timestamp":1096938128000},"page":"325-346","source":"Crossref","is-referenced-by-count":5,"title":["Depth-first K-trees and critical path analysis"],"prefix":"10.1007","volume":"13","author":[{"given":"A. T.","family":"Berztiss","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974"},{"issue":"4","key":"CR2","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1093\/comjnl\/19.4.326","volume":"19","author":"C. Bays","year":"1976","unstructured":"Bays, C.: A non-recursive technique for re-creating a digraph from its K-formula representation. Computer J. 19, 4, 326?328 (1976)","journal-title":"Computer J."},{"issue":"3","key":"CR3","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/321765.321766","volume":"20","author":"A.T. Berztiss","year":"1973","unstructured":"Berztiss, A.T.: A backtrack procedure for isomorphism of directed graphs. J. ACM 20, 3, 365?377 (1973)","journal-title":"J. ACM"},{"key":"CR4","volume-title":"Data structures: theory and practice","author":"A.T. Berztiss","year":"1975","unstructured":"Berztiss, A.T.: Data structures: theory and practice. New York: 2nd ed. Academic Press 1975","edition":"2nd ed."},{"key":"CR5","first-page":"138","volume":"2","author":"A.T. Berztiss","year":"1975","unstructured":"Berztiss, A.T.: A very general data structure. Proc. International Comp. Symp. 1975, Taipei, Vol. 2, 138?145","journal-title":"Proc. International Comp. Symp."},{"key":"CR6","unstructured":"Chester, G.A.: Incremental algorithms in graph theory. Ph.D. Dissertation, University of Toronto, 1976"},{"key":"CR7","volume-title":"The Simula 67 common base language","author":"O.-J. Dahl","year":"1968","unstructured":"Dahl, O.-J., Myhrhaug, B., and Nygaard, K.: The Simula 67 common base language. Oslo: Norwegian Computing Centre 1968"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W., A note on two problems in connexion with graphs. Numer. Math. 1, 269?271 (1959)","journal-title":"Numer. Math."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: Correctness concerns and, among other things, why they are resented. Proc. International Conf. Reliable Software 1975, Los Angeles [SIGPLAN Notices 10, 6], 546?550 (1975)","DOI":"10.1145\/800027.808478"},{"issue":"1","key":"CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(78)90031-5","volume":"7","author":"A. Karayiannis","year":"1978","unstructured":"Karayiannis, A., and Loizou, G.: Cycle detection in critical path networks. Inf. Processing Letters 7, 1, 15?19 (1978)","journal-title":"Inf. Processing Letters"},{"key":"CR11","volume-title":"The art of computer programming, Vol. 1. Fundamental algorithms","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming, Vol. 1. Fundamental algorithms, 2nd ed. Reading, Mass: Addison-Wesley 1973","edition":"2nd ed."},{"issue":"4","key":"CR12","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1145\/321239.321244","volume":"11","author":"L. Krider","year":"1964","unstructured":"Krider, L.: A flow analysis algorithm. J.ACM 11, 4, 429?436 (1964)","journal-title":"J.ACM"},{"issue":"3","key":"CR13","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/321892.321898","volume":"22","author":"J.L. Pfaltz","year":"1975","unstructured":"Pfaltz, J.L.: Representing graphs by Knuth trees. J. ACM 22, 3, 361?366 (1975)","journal-title":"J. ACM"},{"issue":"2","key":"CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/356616.356618","volume":"5","author":"U.W. Pooch","year":"1973","unstructured":"Pooch, U.W. and Nieder, A.: A survey of indexing techniques for sparse matrices. Comput. Surveys 5, 2, 109?133 (1973)","journal-title":"Comput. Surveys"},{"issue":"2","key":"CR15","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput 1, 2 146?160 (1972)","journal-title":"SIAM J. Comput"},{"issue":"1","key":"CR16","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/0203006","volume":"3","author":"R. Tarjan","year":"1974","unstructured":"Tarjan, R.: Finding dominators in directed graphs. SIAM J. Comput. 3, 1 62?89 (1974)","journal-title":"SIAM J. Comput."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288768.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288768\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:27Z","timestamp":1554743667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1980,5]]}},"alternative-id":["BF00288768"],"URL":"https:\/\/doi.org\/10.1007\/bf00288768","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}