{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T00:42:24Z","timestamp":1788482544063,"version":"build-2803163510"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,9]]},"abstract":"<jats:p>Maximum independent set (MIS) is a fundamental problem in graph theory and it has important applications in many areas such as social network analysis, graphical information systems and coding theory. The problem is NP-hard, and there has been numerous studies on its approximate solutions. While successful to a certain degree, the existing methods require memory space at least linear in the size of the input graph. This has become a serious concern in view of the massive volume of today's fast-growing graphs.<\/jats:p>\n          <jats:p>\n            In this paper, we study the MIS problem under the\n            <jats:italic>semi-external<\/jats:italic>\n            setting, which assumes that the main memory can accommodate all vertices of the graph but not all edges. We present a greedy algorithm and a general\n            <jats:italic>vertex-swap<\/jats:italic>\n            framework, which swaps vertices to incrementally increase the size of independent sets. Our solutions require only few sequential scans of graphs on the disk file, thus enabling in-memory computation without costly random disk accesses. Experiments on large-scale datasets show that our solutions are able to compute a large independent set for a massive graph with 59 million vertices and 151 million edges using a commodity machine, with a memory cost of 469MB and a time cost of three minutes, while yielding an approximation ratio that is around 99% of the theoretical optimum.\n          <\/jats:p>","DOI":"10.14778\/2831360.2831366","type":"journal-article","created":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T12:16:36Z","timestamp":1443615396000},"page":"2122-2133","source":"Crossref","is-referenced-by-count":30,"title":["Towards maximum independent sets on massive graphs"],"prefix":"10.14778","volume":"8","author":[{"given":"Yu","family":"Liu","sequence":"first","affiliation":[{"name":"Renmin University of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaheng","family":"Lu","sequence":"additional","affiliation":[{"name":"University of Helsinki, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hua","family":"Yang","sequence":"additional","affiliation":[{"name":"Renmin University of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhewei","family":"Wei","sequence":"additional","affiliation":[{"name":"Renmin University of China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,9]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"An implementation of the C++ standard template library STL for external memory computations. http:\/\/stxxl.sourceforge.net.  An implementation of the C++ standard template library STL for external memory computations. http:\/\/stxxl.sourceforge.net."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0088-5"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335326"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-012-9196-4"},{"key":"e_1_2_1_5_1","first-page":"365","volume-title":"SODA","author":"Berman P.","year":"1994"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780589"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2043363"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/508791.508897"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548010240415X"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.06.009"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_44"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195221"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.09.012"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875499"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795286612"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90032-5"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-642-17458-2_17","volume-title":"Combinatorial Optimization and Applications - 4th International Conference","author":"Shen Y.","year":"2010"},{"key":"e_1_2_1_22_1","volume-title":"Universiteit Utrecht","author":"Strijk T.","year":"2000"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000014"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848102"},{"key":"e_1_2_1_25_1","volume-title":"Bell Labs Technical Journal","author":"Wei V. K.","year":"1981"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/978-3-642-45030-3_31","volume-title":"Algorithms and Computation - 24th International Symposium","author":"Xiao M.","year":"2013"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2831360.2831366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:28:42Z","timestamp":1672219722000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2831360.2831366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":26,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["10.14778\/2831360.2831366"],"URL":"https:\/\/doi.org\/10.14778\/2831360.2831366","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,9]]}}}