{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:17:41Z","timestamp":1648952261690},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0020-0190(85)90055-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"173-179","source":"Crossref","is-referenced-by-count":1,"title":["Enumeration of articulation pairs of a planar graph"],"prefix":"10.1016","volume":"21","author":[{"given":"Jean-Paul","family":"Laumond","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(85)90055-9_BIB1","series-title":"3rd Internat. Coll. on Automata, Languages and Programming","first-page":"411","article-title":"A linear algorithm for testing isomorphism of planar graph","author":"Fontet","year":"1976"},{"key":"10.1016\/0020-0190(85)90055-9_BIB2","article-title":"Connectivit\u00e9 des graphes planaires et automorphisme de cartes; propri\u00e9t\u00e9s et algorithmes","author":"Fontet","year":"1979"},{"key":"10.1016\/0020-0190(85)90055-9_BIB3","series-title":"Complexity of Computer Computation","first-page":"131","article-title":"Isomorphism of planar graph, Working paper","author":"Hopcroft","year":"1972"},{"issue":"3","key":"10.1016\/0020-0190(85)90055-9_BIB4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1974","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0020-0190(85)90055-9_BIB5","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(85)90055-9_BIB6","series-title":"Proc. 8th IJCAI","article-title":"Model structuring and concept recognition: Two aspects of learning for a mobile robot","author":"Laumond","year":"1983"},{"key":"10.1016\/0020-0190(85)90055-9_BIB7","article-title":"Utilisation des graphes planaires pour l'apprentissage de la structure de l'espace d'\u00e9volution d'un robot mobile","author":"Laumond","year":"1984"},{"key":"10.1016\/0020-0190(85)90055-9_BIB8","series-title":"Tech. Rept. 84066","article-title":"Quasi-triangular graphs; drawing planar graph with straight line segments","author":"Laumond","year":"1984"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:28:15Z","timestamp":1553592495000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085900559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0020019085900559"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90055-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}