{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:28:49Z","timestamp":1758709729487},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1109\/tpami.1987.4767900","type":"journal-article","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T21:35:15Z","timestamp":1233264915000},"page":"263-273","source":"Crossref","is-referenced-by-count":44,"title":["Structuring Free Space as a Hypergraph for Roving Robot Path Planning and Navigation"],"prefix":"10.1109","volume":"PAMI-9","author":[{"given":"Kurt D.","family":"Rueb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew K. C.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","article-title":"Computational geometry?A survey","volume":"c 33","author":"lee","year":"1984","journal-title":"IEEE Trans Comput"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-88304-0"},{"key":"ref13","author":"swamy","year":"1981","journal-title":"Graphs Networks and Algorithms"},{"key":"ref14","author":"bondy","year":"1982","journal-title":"Graph Theory with Applications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313112"},{"key":"ref3","author":"yap","year":"1983","journal-title":"Courant Inst Math Sci"},{"key":"ref6","first-page":"197","article-title":"An algorithm for the largest common subgraph isomorphism using the implicit net","author":"wong","year":"1983","journal-title":"Proc IEEE Int Conf Syst Man Cybern"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8997-2_31"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1985.4767707"},{"key":"ref7","author":"berge","year":"1973","journal-title":"Graphs and Hypergraphs"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359156.359164"},{"key":"ref1","first-page":"509","article-title":"A mobile automation, an application of artificial intelligence techniques","author":"nilsson","year":"1969","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref9","author":"chazelle","year":"1980","journal-title":"Computational geometry and convexity"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/34\/4767890\/04767900.pdf?arnumber=4767900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:53:33Z","timestamp":1638219213000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4767900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":14,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpami.1987.4767900","relation":{},"ISSN":["0162-8828"],"issn-type":[{"value":"0162-8828","type":"print"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}