{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:26:28Z","timestamp":1648743988225},"reference-count":11,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,7,1]]},"DOI":"10.1093\/comjnl\/bxm004","type":"journal-article","created":{"date-parts":[[2007,3,6]],"date-time":"2007-03-06T01:28:07Z","timestamp":1173144487000},"page":"473-477","source":"Crossref","is-referenced-by-count":2,"title":["A Linear-Time Constant-Space Algorithm for the Boundary Fill Problem"],"prefix":"10.1093","volume":"50","author":[{"given":"Vladimir M.","family":"Yanovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Israel A.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred M.","family":"Bruckstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2007,3,5]]},"reference":[{"key":"key\n\t\t\t\t20171011185407_BXM004C1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/363534.363554","article-title":"An efficient machine-independent procedure for garbage collection in various list sturctures","volume":"10","author":"Schorr","year":"1967","journal-title":"Commun. ACM"},{"key":"key\n\t\t\t\t20171011185407_BXM004C2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"key\n\t\t\t\t20171011185407_BXM004C3","volume-title":"Computer Graphics","author":"Hearn","year":"1997","edition":"(2nd edn)"},{"key":"key\n\t\t\t\t20171011185407_BXM004C4","volume-title":"Computer Graphics: Principles and Practice in C","author":"Foley","year":"1996","edition":"(2nd edn)"},{"key":"key\n\t\t\t\t20171011185407_BXM004C5","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0097-8493(93)90006-U","article-title":"An efficient flood-filling algorithm","volume":"17","author":"Burtsev","year":"1993","journal-title":"Comput. Graph."},{"key":"key\n\t\t\t\t20171011185407_BXM004C6","first-page":"111","article-title":"How to color in a coloring book","author":"Lieberman","year":"1978"},{"key":"key\n\t\t\t\t20171011185407_BXM004C7","first-page":"321","article-title":"Filling regions in binary raster images: a graph-theoretic approach","author":"Shani","year":"1980"},{"key":"key\n\t\t\t\t20171011185407_BXM004C8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01901287","article-title":"Space-efficient region filling in raster graphics","volume":"10","author":"Henrich","year":"1994","journal-title":"Vis. Comput."},{"key":"key\n\t\t\t\t20171011185407_BXM004C9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6281-8_16","article-title":"Cooperative cleaners \u2013 a study in ant robotics","volume-title":"Communication, Computation, Control and Signal Processing: A Tribute to Thomas Kailath","author":"Wagner","year":"1997"},{"key":"key\n\t\t\t\t20171011185407_BXM004C10","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/356044.356048","article-title":"Space-efficient implementations of graph search methods","volume":"9","author":"Tarjan","year":"1983","journal-title":"ACM Trans. Math. Softw."},{"key":"key\n\t\t\t\t20171011185407_BXM004C11","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1137\/S0097539793282947","article-title":"A time-space tradeoff for undirected graph traversal by walking automata","volume":"28","author":"Beame","year":"1999","journal-title":"SIAM J. Comput."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/50\/4\/473\/1179832\/bxm004.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T06:20:07Z","timestamp":1556173207000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/50\/4\/473\/426953\/A-LinearTime-ConstantSpace-Algorithm-for-the"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,5]]},"references-count":11,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2007,3,5]]},"published-print":{"date-parts":[[2007,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxm004","relation":{},"ISSN":["1460-2067","0010-4620"],"issn-type":[{"value":"1460-2067","type":"electronic"},{"value":"0010-4620","type":"print"}],"subject":[],"published-other":{"date-parts":[[2007,7]]},"published":{"date-parts":[[2007,3,5]]}}}