{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:01:10Z","timestamp":1743069670985,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030757618"},{"type":"electronic","value":"9783030757625"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75762-5_34","type":"book-chapter","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T09:07:43Z","timestamp":1620464863000},"page":"421-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Incrementally Finding the Vertices Absent from the Maximum Independent Sets"],"prefix":"10.1007","author":[{"given":"Xiaochen","family":"Liu","sequence":"first","affiliation":[]},{"given":"Weiguo","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Zhenyi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zhenying","family":"He","sequence":"additional","affiliation":[]},{"given":"X. Sean","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,9]]},"reference":[{"issue":"3","key":"34_CR1","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/COMST.2016.2532458","volume":"18","author":"M Agiwal","year":"2016","unstructured":"Agiwal, M., Roy, A., Saxena, N.: Next generation 5G wireless networks: a comprehensive survey. IEEE Commun. Surv. Tutorials 18(3), 1617\u20131655 (2016)","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"34_CR2","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":"10","key":"34_CR3","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1016\/j.jpdc.2011.06.004","volume":"71","author":"F Ara\u00fajo","year":"2011","unstructured":"Ara\u00fajo, 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."},{"issue":"11","key":"34_CR4","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V Boginski","year":"2006","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Mining market data: a network approach. Comput. Oper. Res. 33(11), 3171\u20133184 (2006)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: 004, May). The webgraph framework I: compression techniques. In: ACM WWW (2004)","key":"34_CR5","DOI":"10.1145\/988672.988752"},{"issue":"6","key":"34_CR6","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"JM Byskov","year":"2004","unstructured":"Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32(6), 547\u2013556 (2004)","journal-title":"Oper. Res. Lett."},{"doi-asserted-by":"crossref","unstructured":"Cao, J., et al.: A neural network based conflict-graph construction approach for ultra-dense networks. In: IEEE Globecom Workshops (2018)","key":"34_CR7","DOI":"10.1109\/GLOCOMW.2018.8644273"},{"doi-asserted-by":"crossref","unstructured":"Chang, L., Li, W., Zhang, W.: Computing a near-maximum independent set in linear time by reducing-peeling. In: ACM SIGMOD, pp. 1181\u20131196 (2017)","key":"34_CR8","DOI":"10.1145\/3035918.3035939"},{"issue":"S\u201310","key":"34_CR9","doi-asserted-by":"publisher","first-page":"S5","DOI":"10.1186\/1471-2105-13-S10-S5","volume":"13","author":"JD Eblen","year":"2012","unstructured":"Eblen, J.D., Phillips, C.A., Rogers, G.L., Langston, M.A.: The maximum clique enumeration problem: algorithms, applications, and implementations. BMC Bioinform. 13(S\u201310), S5 (2012)","journal-title":"BMC Bioinform."},{"issue":"5","key":"34_CR10","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/1552285.1552286","volume":"56","author":"FV Fomin","year":"2009","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 25:1-25:32 (2009)","journal-title":"J. ACM"},{"unstructured":"Friend, D.: Cognitive networks: foundations to applications. Ph.D. thesis, Virginia Tech, Blacksburg, VA, USA (2009)","key":"34_CR11"},{"issue":"2\u20133","key":"34_CR12","first-page":"16:1","volume":"14","author":"M Hoefer","year":"2014","unstructured":"Hoefer, M., Kesselheim, T., V\u00f6cking, B.: Approximation algorithms for secondary spectrum auctions. ACM Trans. Internet Techn. 14(2\u20133), 16:1-16:24 (2014)","journal-title":"ACM Trans. Internet Techn."},{"issue":"3","key":"34_CR13","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TNET.2015.2417861","volume":"24","author":"C Joo","year":"2016","unstructured":"Joo, C., Lin, X., Ryu, J., Shroff, N.B.: Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels. IEEE\/ACM Trans. Netw. 24(3), 1476\u20131488 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)","key":"34_CR14"},{"doi-asserted-by":"crossref","unstructured":"Skiena, S.: The Algorithm Design Manual. Second Edition, Springer (2008)","key":"34_CR15","DOI":"10.1007\/978-1-84800-070-4"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75762-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:17:58Z","timestamp":1710350278000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75762-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757618","9783030757625"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75762-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"673","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":"157","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":"23% - 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":"7","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)"}}]}}