{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:09:42Z","timestamp":1762459782578,"version":"3.37.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030336356"},{"type":"electronic","value":"9783030336363"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33636-3_11","type":"book-chapter","created":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T10:02:20Z","timestamp":1571479340000},"page":"298-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Analysis of Repeated Graph Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0140-8089","authenticated-orcid":false,"given":"Roland","family":"Backhouse","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,20]]},"reference":[{"key":"11_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1982)"},{"key":"11_CR2","unstructured":"Backhouse, R.C.: Closure algorithms and the star-height problem of regular languages. Ph.D. thesis, University of London (1975). \n                    https:\/\/spiral.imperial.ac.uk\/bitstream\/10044\/1\/22243\/2\/Backhouse-RC-1976-PhD-Thesis.pdf"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","volume":"15","author":"RC Backhouse","year":"1975","unstructured":"Backhouse, R.C., Carr\u00e9, B.A.: Regular algebra applied to path-finding problems. J. Inst. Math. Appl. 15, 161\u2013186 (1975)","journal-title":"J. Inst. Math. Appl."},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1017\/S096012950000030X","volume":"3","author":"RC Backhouse","year":"1993","unstructured":"Backhouse, R.C., van der Woude, J.: Demonic operators and monotype factors. Math. Struct. Comput. Sci. 3(4), 417\u2013433 (1993)","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.jlap.2005.04.008","volume":"66","author":"R Backhouse","year":"2006","unstructured":"Backhouse, R.: Regular algebra applied to language problems. J. Logic Algebraic Program. 66, 71\u2013111 (2006)","journal-title":"J. Logic Algebraic Program."},{"key":"11_CR6","unstructured":"Backhouse, R., Doornbos, H., Gl\u00fcck, R., van\u00a0der Woude, J.: Algorithmic graph theory: an exercise in point-free reasoning (2019). \n                    http:\/\/www.cs.nott.ac.uk\/~pasrb2\/MPC\/BasicGraphTheory.pdf\n                    \n                  , Also available online at ResearchGate"},{"issue":"1\u20132","key":"11_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0167-6423(94)90005-1","volume":"22","author":"RC Backhouse","year":"1994","unstructured":"Backhouse, R.C., van den Eijnde, J.P.H.W., van Gasteren, A.J.M.: Calculating path algorithms. Sci. Comput. Program. 22(1\u20132), 3\u201319 (1994)","journal-title":"Sci. Comput. Program."},{"key":"11_CR8","volume-title":"Regular Algebra and Finite Machines","author":"JH Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)"},{"key":"11_CR9","series-title":"MIT Electrical Engineering and Computer Science Series","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Electrical Engineering and Computer Science Series. MIT Press, Cambridge (1990)"},{"key":"11_CR10","series-title":"MIT Electrical Engineering and Computer Science Series","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Electrical Engineering and Computer Science Series, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1\u20133","key":"11_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0167-6423(95)00027-5","volume":"26","author":"H Doornbos","year":"1996","unstructured":"Doornbos, H., Backhouse, R.: Reductivity. Sci. Comput. Program. 26(1\u20133), 217\u2013236 (1996)","journal-title":"Sci. Comput. Program."},{"key":"11_CR12","volume-title":"Categories","author":"PJ Freyd","year":"1990","unstructured":"Freyd, P.J., \u0160\u010dedrov, A.: Categories. North-Holland, Allegories (1990)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-57418-9_7","volume-title":"Relational and Algebraic Methods in Computer Science","author":"R Gl\u00fcck","year":"2017","unstructured":"Gl\u00fcck, R.: Algebraic investigation of connected components. In: H\u00f6fner, P., Pous, D., Struth, G. (eds.) RAMICS 2017. LNCS, vol. 10226, pp. 109\u2013126. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-57418-9_7"},{"issue":"1\u20132","key":"11_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6423(94)90008-6","volume":"22","author":"P Hoogendijk","year":"1994","unstructured":"Hoogendijk, P., Backhouse, R.C.: Relational programming laws in the tree, list, bag, set hierarchy. Sci. Comput. Program. 22(1\u20132), 67\u2013105 (1994)","journal-title":"Sci. Comput. Program."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"King, D.J., Launchbury, J.: Structuring depth-first search algorithms in Haskell. In: POPL 1995. Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programmming Languages, pp. 344\u2013354 (1995)","DOI":"10.1145\/199448.199530"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0898-1221(81)90008-0","volume":"7","author":"M Sharir","year":"1981","unstructured":"Sharir, M.: A strong-connectivity algorithm and its application in data flow analysis. Comput. Math. Appl. 7(1), 67\u201372 (1981)","journal-title":"Comput. Math. Appl."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM J. Comput. 1, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33636-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T10:10:54Z","timestamp":1571479854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33636-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030336356","9783030336363"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33636-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematics of Program Construction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mpc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.nott.ac.uk\/~pszgmh\/mpc19.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}