{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:49Z","timestamp":1759063669619},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":[[1998,5]]},"DOI":"10.1016\/s0020-0190(98)00071-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"209-213","source":"Crossref","is-referenced-by-count":12,"title":["Linear time algorithms for graph search and connectivity determination on complement graphs"],"prefix":"10.1016","volume":"66","author":[{"given":"Hiro","family":"Ito","sequence":"first","affiliation":[]},{"given":"Mitsuo","family":"Yokoyama","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00071-4_BIB1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0204034","article-title":"An algorithm for determining whether the connectivity of a graph is at least k","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00071-4_BIB2","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/jgt.3190170302","article-title":"On sparse subgraphs preserving connectivity properties","volume":"17","author":"Frank","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(98)00071-4_BIB3","series-title":"Proc. 23rd ACM Symp. Theory of Computing","first-page":"123","article-title":"Clique partition, graph compression and speeding-up algorithms","author":"Feder","year":"1991"},{"key":"10.1016\/S0020-0190(98)00071-4_BIB4","series-title":"Proc. 23rd ACM Symp. Theory of Computing","first-page":"112","article-title":"A matroid approach to finding edge connectivity and packing arborescences","author":"Gabow","year":"1991"},{"key":"10.1016\/S0020-0190(98)00071-4_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00071-4_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/122413.122416","article-title":"Reducing edge connectivity to vertex connectivity","volume":"22","author":"Galil","year":"1991","journal-title":"SIGACT News"},{"key":"10.1016\/S0020-0190(98)00071-4_BIB7","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(98)00071-4_BIB8","series-title":"Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms","first-page":"146","article-title":"Computing minimal spanning subgraphs in linear time","author":"Han","year":"1992"},{"key":"10.1016\/S0020-0190(98)00071-4_BIB9","first-page":"43","article-title":"Dividing a graph into triconnected components","volume":"79","author":"Hopcroft","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(98)00071-4_BIB10","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1137\/0215033","article-title":"Efficient algorithms for geometric graph search problems","volume":"15","author":"Imai","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00071-4_BIB11","series-title":"Proc. 32nd IEEE Symp. Found. Comp. Sci.","first-page":"793","article-title":"On-line maintenance of the four-connected components of a graph","author":"Kanevsky","year":"1991"},{"key":"10.1016\/S0020-0190(98)00071-4_BIB12","series-title":"Proc. of ISSAC-94","first-page":"451","article-title":"Simple and efficient graph compression schemes for dense and complement graphs","volume":"Vol. 834","author":"Kao","year":"1994"},{"key":"10.1016\/S0020-0190(98)00071-4_BIB13","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","article-title":"A linear-time algorithm for finding a sparse k-connected spanning subgraph of k-connected graph","volume":"7","author":"Nagamochi","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(98)00071-4_BIB14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF03167564","article-title":"A linear time algorithm for computing 3-edge-connected components in a multigraph","volume":"9","author":"Nagamochi","year":"1992","journal-title":"Japan J. Industrial Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000714?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000714?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:54:02Z","timestamp":1555959242000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0020019098000714"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00071-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}