{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:07:04Z","timestamp":1775815624774,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":[[1994,8]]},"DOI":"10.1016\/0020-0190(94)90121-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"207-211","source":"Crossref","is-referenced-by-count":90,"title":["Arboricity and bipartite subgraph listing algorithms"],"prefix":"10.1016","volume":"51","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90121-X_BIB1","first-page":"338","article-title":"Can visibility graphs be represented compactly?","author":"Agarwal","year":"1993","journal-title":"Proc. 9th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(94)90121-X_BIB2","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1021\/ci00010a007","article-title":"Similarity searching in databases of three-dimensional molecules and macromolecules","volume":"32","author":"Artymiuk","year":"1992","journal-title":"J. Chemical Inform. Comput. Sci."},{"key":"10.1016\/0020-0190(94)90121-X_BIB3","series-title":"Computing in Euclidean Geometry","first-page":"23","article-title":"Mesh generation and optimal triangulation","author":"Bern","year":"1992"},{"key":"10.1016\/0020-0190(94)90121-X_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)90121-X_BIB5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1049\/ip-i-1.1988.0025","article-title":"Goal-oriented subgraph isomorphism technique for IC device recognition","volume":"135","author":"Brown","year":"1988","journal-title":"IEE Proc. I (Solid-State and Electron Devices)"},{"key":"10.1016\/0020-0190(94)90121-X_BIB6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","article-title":"Arboricity and subgraph listing algorithms","volume":"14","author":"Chiba","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90121-X_BIB7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","article-title":"Planar orientations with low out-degree and compaction of adjacency matrices","volume":"86","author":"Chrobak","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(94)90121-X_BIB8","first-page":"177","article-title":"A linear-time algorithm for testing the inscribability of trivalent polhedra","author":"Dillencourt","year":"1992","journal-title":"Proc. 8th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(94)90121-X_BIB9","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/jgt.3190170314","article-title":"Connectivity, graph minors, and subgraph multiplicity","volume":"17","author":"Eppstein","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/0020-0190(94)90121-X_BIB10","first-page":"407","article-title":"Foreses, frames. and games: algorithms for matroid sums and applications","author":"Gabow","year":"1988","journal-title":"Proc. 20th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90121-X_BIB11","first-page":"486","article-title":"Optimizing codes or concurrent fault-detection in micro-programmed controllers","author":"Guha","year":"1987","journal-title":"Proc. IEEE Internat. Conf. Computer Design: VLSI in Computers and Processors (ICCD '87)"},{"key":"10.1016\/0020-0190(94)90121-X_BIB12","first-page":"920","article-title":"An ARG representation for Chinese characters and a radical extraction based on the representation","volume":"Vol. 2","author":"Dong","year":"1988","journal-title":"Proc. 9th IEEE Internat. Conf. on Pattern Recognition"},{"key":"10.1016\/0020-0190(94)90121-X_BIB13","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/ISIC.1991.187374","article-title":"A sensor model registration technique for mobile robot localization","author":"Lang","year":"1991","journal-title":"Proc. 1991 IEEE Internat. Symp. on Intelligent Control"},{"key":"10.1016\/0020-0190(94)90121-X_BIB14","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0898-1221(92)90125-2","article-title":"Pattern associativity and the retrieval of semantic networks","volume":"23","author":"Levinson","year":"1992","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0020-0190(94)90121-X_BIB15","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/SFCS.1991.185417","article-title":"A unified geometric approach to graph separators","author":"Miller","year":"1991","journal-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)90121-X_BIB16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0020-0190(94)90121-X_BIB17","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90121-X_BIB18","first-page":"138","article-title":"Embedding planar graphs on the grid","author":"Schnyder","year":"1990","journal-title":"Proc. 1st ACM \u2013 SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0020-0190(94)90121-X_BIB19","first-page":"155","article-title":"Recognition of polyhedral objects under perspective views","volume":"11","author":"Stahs","year":"1992","journal-title":"Comput. Artificial Intelligence"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909490121X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909490121X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:51:29Z","timestamp":1555145489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909490121X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["002001909490121X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90121-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}