{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:17:09Z","timestamp":1766578629890,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030342227"},{"type":"electronic","value":"9783030342234"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34223-4_45","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:14:40Z","timestamp":1573690480000},"page":"711-727","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Maximum Independent Sets over Large Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Maram","family":"Alsahafy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,29]]},"reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.tcs.2015.09.023","volume":"609","author":"T Akiba","year":"2016","unstructured":"Akiba, T., Iwata, Y.: Branch-and-reduce exponential\/fpt algorithms in practice: a case study of vertex cover. Theor. Comput. Sci. 609, 211\u2013225 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"45_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525\u2013547 (2012)","journal-title":"J. Heuristics"},{"issue":"10","key":"45_CR3","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1016\/j.jpdc.2011.06.004","volume":"71","author":"F Araujo","year":"2011","unstructured":"Araujo, F., Farinha, J., Domingues, P., Silaghi, G.C., Kondo, D.: A maximum independent set approach for collusion detection in voting pools. J. Parallel Distrib. Comput. 71(10), 1356\u20131366 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"van Bevern, R., Mnich, M., Niedermeier, R., Weller, M.: Interval scheduling and colorful independent sets. CoRR abs\/1402.0851 (2014)","DOI":"10.1007\/s10951-014-0398-5"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Chang, L.: Efficient maximum clique computation over large sparse graphs. In: Proceedings of KDD 2019, pp. 529\u2013538 (2019)","DOI":"10.1109\/ICDE.2019.00241"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Chang, L., Li, W., Zhang, W.: Computing a near-maximum independent set in linear time by reducing-peeling. In: Proceedings of SIGMOD 2017, pp. 1181\u20131196 (2017)","DOI":"10.1145\/3035918.3035939"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Dahlum, J., Lamm, S., Sanders, P., Schulz, C., Strash, D., Werneck, R.F.: Accelerating local search for the maximum independent set problem. In: Proceedings of SEA 2016 (2016)","DOI":"10.1007\/978-3-319-38851-9_9"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 25 (2009)","DOI":"10.1145\/1552285.1552286"},{"key":"45_CR9","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n$${}^{\\text{1-epsilon}}$$. In: Proceedings of FOCS 1996, pp. 627\u2013636 (1996)"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Hespe, D., Schulz, C., Strash, D.: Scalable kernelization for maximum independent sets. In: Proceedings of ALENEX 2018, pp. 223\u2013237 (2018)","DOI":"10.1137\/1.9781611975055.19"},{"key":"45_CR11","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Lamm, S., Sanders, P., Schulz, C., Strash, D., Werneck, R.F.: Finding near-optimal independent sets at scale. In: Proceedings of ALENEX 2016, pp. 138\u2013150 (2016)","DOI":"10.1137\/1.9781611974317.12"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Li, C., Fang, Z., Xu, K.: Combining maxsat reasoning and incremental upper bound for the maximum clique problem. In: Proceedings of ICTAI 2013, pp. 939\u2013946 (2013)","DOI":"10.1109\/ICTAI.2013.143"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.02.017","volume":"84","author":"CM Li","year":"2017","unstructured":"Li, C.M., Jiang, H., Many\u00e0, F.: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Comput. Oper. Res. 84, 1\u201315 (2017)","journal-title":"Comput. Oper. Res."},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Liu, Y., Lu, J., Yang, H., Xiao, X., Wei, Z.: Towards maximum independent sets on massive graphs. PVLDB 8(13), 2122\u20132133 (2015)","DOI":"10.14778\/2831360.2831366"},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Nemhauser Jr., G. L., Trotter, L.: Vertex packings: structural properties and algorithms. Math Programm. 8(1), 232\u2013248 (1975)","DOI":"10.1007\/BF01580444"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Puthal, D., Nepal, S., Paris, C., Ranjan, R., Chen, J.: Efficient algorithms for social network coverage and reach. In: 2015 IEEE International Congress on Big Data, pp. 467\u2013474 (2015)","DOI":"10.1109\/BigDataCongress.2015.75"},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Strijk, T., Verweij, A., Aardal, K.: Algorithms for maximum independent set applied to map labelling (2000)","DOI":"10.1007\/3-540-48481-7_37"},{"key":"45_CR19","doi-asserted-by":"crossref","unstructured":"Tomita, E.: Efficient algorithms for finding maximum and maximal cliques and their applications. In: Proceedings of WALCOM 2017, pp. 3\u201315 (2017)","DOI":"10.1007\/978-3-319-53925-6_1"},{"key":"45_CR20","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2012.09.022","volume":"469","author":"M Xiao","year":"2013","unstructured":"Xiao, M., Nagamochi, H.: Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs. Theor. Comput. Sci. 469, 92\u2013104 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR21","doi-asserted-by":"crossref","unstructured":"Zheng, W., Wang, Q., Yu, J.X., Cheng, H., Zou, L.: Efficient computation of a near-maximum independent set over evolving graphs. In: Proceedings of ICDE 2018 (2018)","DOI":"10.1109\/ICDE.2018.00083"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34223-4_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:34:30Z","timestamp":1710336870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-34223-4_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030342227","9783030342234"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34223-4_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2019.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"211","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"WISE 2019 has been postponed until January 2020 because of the problems in Hong Kong. For CCIS volume, Submissions: 30. Full papers accepted: 10. Short papers accepted: 5.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}