{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:06:12Z","timestamp":1742922372286,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819612413"},{"type":"electronic","value":"9789819612420"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1242-0_36","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T08:07:50Z","timestamp":1733990870000},"page":"492-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Weight Relative Fair Clique Computation in\u00a0Attributed Graphs"],"prefix":"10.1007","author":[{"given":"Yijia","family":"Mi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongye","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"issue":"3","key":"36_CR1","first-page":"2875","volume":"35","author":"J Ali","year":"2021","unstructured":"Ali, J., Babaei, M., Chakraborty, A., Mirzasoleiman, B., Gummadi, K.P., Singla, A.: On the fairness of time-critical influence maximization in social networks. IEEE Trans. Knowl. Data Eng. 35(3), 2875\u20132886 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9","key":"36_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ins.2018.08.052","volume":"471","author":"S Cai","year":"2019","unstructured":"Cai, S., Li, Y., Hou, W., Wang, H.: Towards faster local search for minimum weight vertex cover on massive graphs. Inf. Sci. 471, 64\u201379 (2019)","journal-title":"Inf. Sci."},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1613\/jair.1.12327","volume":"72","author":"S Cai","year":"2021","unstructured":"Cai, S., Lin, J., Wang, Y., Strash, D.: A semi-exact algorithm for quickly computing a maximum weight clique in large sparse graphs. J. Artif. Intell. Res. 72, 39\u201367 (2021)","journal-title":"J. Artif. Intell. Res."},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Chang, L.: Efficient maximum clique computation over large sparse graphs. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 529\u2013538 (2019)","DOI":"10.1145\/3292500.3330986"},{"issue":"2","key":"36_CR6","first-page":"1791","volume":"35","author":"C Chen","year":"2021","unstructured":"Chen, C., Wu, Y., Sun, R., Wang, X.: Maximum signed $$ \\theta $$-clique identification in large signed graphs. IEEE Trans. Knowl. Data Eng. 35(2), 1791\u20131802 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, C., Luo, S., Hu, J.: Effective community search for large attributed graphs. In: Proceedings of the VLDB Endowment (2016)","DOI":"10.14778\/2994509.2994538"},{"key":"36_CR8","unstructured":"Fang, Z., Li, C.M., Qiao, K., Feng, X., Xu, K.: Solving maximum weight clique using maximum satisfiability reasoning. In: ECAI 2014, pp. 303\u2013308. IOS Press (2014)"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"101914","DOI":"10.1016\/j.is.2021.101914","volume":"104","author":"MS Islam","year":"2022","unstructured":"Islam, M.S., Ali, M.E., Kang, Y.B., Sellis, T., Choudhury, F.M., Roy, S.: Keyword aware influential community search in large attributed graphs. Inf. Syst. 104, 101914 (2022)","journal-title":"Inf. Syst."},{"issue":"6","key":"36_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3578268","volume":"17","author":"ZS Jalali","year":"2023","unstructured":"Jalali, Z.S., et al.: Fairness of information flow in social networks. ACM Trans. Knowl. Discov. Data 17(6), 1\u201326 (2023)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"2","key":"36_CR11","doi-asserted-by":"publisher","first-page":"102054","DOI":"10.1016\/j.ipm.2019.102054","volume":"57","author":"A Khan","year":"2020","unstructured":"Khan, A., Golab, L., Kargar, M., Szlichta, J., Zihayat, M.: Compact group discovery in attributed graphs and social networks. Inf. Process. Manage. 57(2), 102054 (2020)","journal-title":"Inf. Process. Manage."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Lamm, S., Schulz, C., Strash, D., Williger, R., Zhang, H.: Exactly solving the maximum weight independent set problem on large real-world graphs. In: 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (alenex), pp. 144\u2013158. SIAM (2019)","DOI":"10.1137\/1.9781611975499.12"},{"issue":"1","key":"36_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2018.03.020","volume":"270","author":"CM Li","year":"2018","unstructured":"Li, C.M., Liu, Y., Jiang, H., Many\u00e0, F., Li, Y.: A new upper bound for the maximum weight clique problem. Eur. J. Oper. Res. 270(1), 66\u201377 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"36_CR14","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1080\/01605682.2019.1621218","volume":"71","author":"R Li","year":"2020","unstructured":"Li, R., Hu, S., Cai, S., Gao, J., Wang, Y., Yin, M.: NuMWVC: a novel local search for minimum weighted vertex cover problem. J. Oper. Res. Soc. 71(9), 1498\u20131509 (2020)","journal-title":"J. Oper. Res. Soc."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.dam.2017.01.026","volume":"223","author":"S Shimizu","year":"2017","unstructured":"Shimizu, S., Yamaguchi, K., Saitoh, T., Masuda, S.: Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound. Discret. Appl. Math. 223, 120\u2013134 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"36_CR16","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s11280-021-00904-4","volume":"25","author":"R Sun","year":"2022","unstructured":"Sun, R., Chen, C., Wang, X., Wu, Y., Zhang, M., Liu, X.: The art of characterization in large networks: finding the critical attributes. World Wide Web 25(2), 655\u2013677 (2022)","journal-title":"World Wide Web"},{"issue":"12","key":"36_CR17","doi-asserted-by":"publisher","first-page":"12513","DOI":"10.1109\/TKDE.2023.3272636","volume":"35","author":"R Sun","year":"2023","unstructured":"Sun, R., Wu, Y., Wang, X., Chen, C., Zhang, W., Lin, X.: Clique identification in signed graphs: a balance theory based model. IEEE Trans. Knowl. Data Eng. 35(12), 12513\u201312527 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"103230","DOI":"10.1016\/j.artint.2019.103230","volume":"280","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Cai, S., Chen, J., Yin, M.: SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem. Artif. Intell. 280, 103230 (2020)","journal-title":"Artif. Intell."},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Wu, Y., Sun, R., Chen, C., Wang, X., Zhu, Q.: Maximum signed (k, r)-truss identification in signed networks. In: ACM International Conference on Information & Knowledge Management (2020)","DOI":"10.1145\/3340531.3417457"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Wu, Y., Sun, R., Chen, C., Wang, X., Fu, X.: Efficiently answering minimum reachable label set queries in edge-labeled graphs. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pp. 4585\u20134589 (2022)","DOI":"10.1145\/3511808.3557593"},{"issue":"3","key":"36_CR21","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s41019-021-00163-3","volume":"6","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Zhao, J., Sun, R., Chen, C., Wang, X.: Efficient personalized influential community search in large networks. Data Sci. Eng. 6(3), 310\u2013322 (2021)","journal-title":"Data Sci. Eng."},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Yin, Z., Zhang, Q., Zhang, W., Li, R.H., Wang, G.: Fairness-aware maximal biclique enumeration on bipartite graphs. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 1665\u20131677. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00131"},{"issue":"11","key":"36_CR23","doi-asserted-by":"publisher","first-page":"11368","DOI":"10.1109\/TKDE.2022.3232165","volume":"35","author":"Q Zhang","year":"2023","unstructured":"Zhang, Q., Li, R.H., Pan, M., Dai, Y., Tian, Q., Wang, G.: Fairness-aware maximal clique in large graphs: concepts and algorithms. IEEE Trans. Knowl. Data Eng. 35(11), 11368\u201311387 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-031-47843-7_21","volume-title":"ADC 2023","author":"Y Zhang","year":"2023","unstructured":"Zhang, Y., Liu, S., Wu, Y., Qin, L., Zhang, Y.: Efficient maximum relative fair clique computation in attributed graphs. In: Bao, Z., Borovica-Gajic, R., Qiu, R., Choudhury, F., Yang, Z. (eds.) ADC 2023. LNCS, vol. 14386, pp. 301\u2013312. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47843-7_21"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1242-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T20:07:44Z","timestamp":1736194064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1242-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9789819612413","9789819612420"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1242-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}