{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T17:14:25Z","timestamp":1781370865033,"version":"3.54.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031478420","type":"print"},{"value":"9783031478437","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47843-7_21","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:27:25Z","timestamp":1699306045000},"page":"301-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Maximum Relative Fair Clique Computation in\u00a0Attributed Graphs"],"prefix":"10.1007","author":[{"given":"Yufeng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shiyuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanping","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Ali, J., Babaei, M., Chakraborty, A., Mirzasoleiman, B., Gummadi, K., Singla, A.: On the fairness of time-critical influence maximization in social networks. IEEE Trans. Knowl. Data Eng. (2021)","DOI":"10.1109\/TKDE.2021.3120561"},{"issue":"9","key":"21_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"},{"issue":"1\u20133","key":"21_CR3","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F Cazals","year":"2008","unstructured":"Cazals, F., Karande, C.: A note on the problem of reporting maximal cliques. Theor. Comput. Sci. 407(1\u20133), 564\u2013568 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR4","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"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Chen, C., Wu, Y., Sun, R., Wang, X.: Maximum signed $$\\theta $$-clique identification in large signed graphs. IEEE Trans. Knowl. Data Eng. (2021)","DOI":"10.1109\/TKDE.2021.3098423"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Dai, E., Wang, S.: Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, pp. 680\u2013688 (2021)","DOI":"10.1145\/3437963.3441752"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Dong, Y., Kang, J., Tong, H., Li, J.: Individual fairness for graph neural networks: a ranking based approach. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 300\u2013310 (2021)","DOI":"10.1145\/3447548.3467266"},{"issue":"12","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. Proc. VLDB Endow. 9(12), 1233\u20131244 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"21_CR9","doi-asserted-by":"publisher","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":"21_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3578268","volume":"17","author":"ZS Jalali","year":"2023","unstructured":"Jalali, Z.S., Chen, Q., Srikanta, S.M., Wang, W., Kim, M., Raghavan, H., Soundarajan, S.: Fairness of information flow in social networks. ACM Trans. Knowl. Discov. Data 17(6), 1\u201326 (2023)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"21_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115915","volume":"187","author":"Y Jin","year":"2022","unstructured":"Jin, Y., Xiong, B., He, K., Zhou, Y., Zhou, Y.: On fast enumeration of maximal cliques in large graphs. Expert Syst. Appl. 187, 115915 (2022)","journal-title":"Expert Syst. Appl."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Kang, J., He, J., Maciejewski, R., Tong, H.: Inform: individual fairness on graph mining. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 379\u2013389 (2020)","DOI":"10.1145\/3394486.3403080"},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","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. Manag. 57(2), 102054 (2020)","journal-title":"Inf. Process. Manag."},{"key":"21_CR14","unstructured":"Kusner, M.J., Loftus, J., Russell, C., Silva, R.: Counterfactual fairness. Adv. Neural Inf. Process. Syst. 30 (2017)"},{"issue":"1\u20133","key":"21_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PR \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.: A fast algorithm for the maximum clique problem. Discret. Appl. Math. 120(1\u20133), 197\u2013207 (2002)","journal-title":"Discret. Appl. Math."},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Pattabiraman, B., Patwary, M.M.A., Gebremedhin, A.H., Liao, W.K., Choudhary, A.: Fast algorithms for the maximum clique problem on massive graphs with applications to overlapping community detection. Internet Math. 11(4\u20135), 421\u2013448 (2015)","DOI":"10.1080\/15427951.2014.986778"},{"issue":"5","key":"21_CR17","doi-asserted-by":"publisher","first-page":"C589","DOI":"10.1137\/14100018X","volume":"37","author":"RA Rossi","year":"2015","unstructured":"Rossi, R.A., Gleich, D.F., Gebremedhin, A.H.: Parallel maximum clique algorithms with applications to network analysis. SIAM J. Sci. Comput. 37(5), C589\u2013C616 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"21_CR18","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"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, W., Zhang, Y., Lin, X.: Efficient maximum signed biclique identification. In: ICDE, pp. 1313\u20131325 (2023)","DOI":"10.1109\/ICDE55515.2023.00105"},{"key":"21_CR20","unstructured":"Sun, R., Wu, Y., Wang, X.: Diversified top-r community search in geo-social network: a k-truss based model. In: EDBT (2022)"},{"key":"21_CR21","doi-asserted-by":"crossref","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. (2023)","DOI":"10.1109\/TKDE.2023.3272636"},{"key":"21_CR22","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: CIKM, pp. 4585\u20134589 (2022)","DOI":"10.1145\/3511808.3557593"},{"issue":"3","key":"21_CR23","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":"21_CR24","doi-asserted-by":"crossref","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. (2023)","DOI":"10.1109\/TKDE.2022.3232165"}],"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-3-031-47843-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:34:26Z","timestamp":1699306466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47843-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"ISBN":["9783031478420","9783031478437"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47843-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"7 November 2023","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":"Melbourne, VIC","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2023","order":10,"name":"conference_id","label":"Conference ID","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","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":"26","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":"63% - 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":"2.5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}