{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T11:03:59Z","timestamp":1793444639342,"version":"4.5.0"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,2]]},"abstract":"<jats:p>In this paper we introduce a new simple strategy into edge-searching of a graph, which is useful to the various subgraph listing problems. Applying the strategy, we obtain the following four algorithms. The first one lists all the triangles in a graph G in $O(a(G)m)$ time, where m is the number of edges of G and $a(G)$ the arboricity of G. The second finds all the quadrangles in $O(a(G)m)$ time. Since $a(G)$ is at most three for a planar graph G, both run in linear time for a planar graph. The third lists all the complete subgraphs $K_l $ of order l in $O(la(G)^{l - 2} m)$ time. The fourth lists all the cliques in $O(a(G)m)$ time per clique. All the algorithms require linear space. We also establish an upper bound on $a(G)$ for a graph $G:a(G) \\leqq \\lceil (2m + n)^{1\/2} \\rceil $, where n is the number of vertices in G.<\/jats:p>","DOI":"10.1137\/0214017","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"210-223","source":"Crossref","is-referenced-by-count":476,"title":["Arboricity and Subgraph Listing Algorithms"],"prefix":"10.1137","volume":"14","author":[{"given":"Norishige","family":"Chiba","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/321607.321608"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda, S. Even,  On approximating a vertex cover for planar graphs,  Proc. 14th Annual ACM Symposium on Theory of Computing, San Francisco,  1982,  303\u2013309, May 5\u20137","DOI":"10.1145\/800070.802205"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130209"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90042-2"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90041-7"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.3.237"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:24Z","timestamp":1787337744000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["10.1137\/0214017"],"URL":"https:\/\/doi.org\/10.1137\/0214017","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}