{"id":"https://openalex.org/W1546313639","doi":"https://doi.org/10.1109/icde.2015.7113300","title":"Diversified top-k clique search","display_name":"Diversified top-k clique search","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1546313639","doi":"https://doi.org/10.1109/icde.2015.7113300","mag":"1546313639"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2015.7113300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2015.7113300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 31st International Conference on Data Engineering","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://opus.lib.uts.edu.au/bitstream/10453/43795/1/%5b2015%20VLDBJ%5d%20Diversified%20Top-K%20Clique%20Search.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101874653","display_name":"Long Yuan","orcid":"https://orcid.org/0000-0002-9896-0805"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Long Yuan","raw_affiliation_strings":["The University of New South Wales, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046220908","display_name":"Lu Qin","orcid":"https://orcid.org/0000-0001-6068-5062"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]},{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lu Qin","raw_affiliation_strings":["Centre for QCIS, University of Technology, Sydney, Australia","The University of New South Wales, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for QCIS, University of Technology, Sydney, Australia","institution_ids":["https://openalex.org/I114017466"]},{"raw_affiliation_string":"The University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079659938","display_name":"Xuemin Lin","orcid":"https://orcid.org/0000-0003-2396-7225"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]}],"countries":["AU","CN"],"is_corresponding":false,"raw_author_name":"Xuemin Lin","raw_affiliation_strings":["East China Normal University, China","The University of New South Wales, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"East China Normal University, China","institution_ids":["https://openalex.org/I66867065"]},{"raw_affiliation_string":"The University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037530341","display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["The University of New South Wales, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100385498","display_name":"Wenjie Zhang","orcid":"https://orcid.org/0000-0001-6572-2600"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Wenjie Zhang","raw_affiliation_strings":["The University of New South Wales, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"387","last_page":"398"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.7865831255912781},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.647853672504425},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5058600306510925},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4564904570579529},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44802623987197876},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4404182732105255},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.43692657351493835},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4321918785572052},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4266185462474823},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4139930009841919},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4069169759750366},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3564072847366333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33065885305404663},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14611437916755676},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10168465971946716},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07076159119606018}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7865831255912781},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.647853672504425},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5058600306510925},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4564904570579529},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44802623987197876},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4404182732105255},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.43692657351493835},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4321918785572052},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4266185462474823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4139930009841919},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4069169759750366},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3564072847366333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33065885305404663},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14611437916755676},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10168465971946716},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07076159119606018}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icde.2015.7113300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2015.7113300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 31st International Conference on Data Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:opus.lib.uts.edu.au:10453/43795","is_oa":true,"landing_page_url":"http://hdl.handle.net/10453/43795","pdf_url":"https://opus.lib.uts.edu.au/bitstream/10453/43795/1/%5b2015%20VLDBJ%5d%20Diversified%20Top-K%20Clique%20Search.pdf","source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:opus.lib.uts.edu.au:10453/41387","is_oa":false,"landing_page_url":"http://hdl.handle.net/10453/41387","pdf_url":null,"source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceeding"}],"best_oa_location":{"id":"pmh:oai:opus.lib.uts.edu.au:10453/43795","is_oa":true,"landing_page_url":"http://hdl.handle.net/10453/43795","pdf_url":"https://opus.lib.uts.edu.au/bitstream/10453/43795/1/%5b2015%20VLDBJ%5d%20Diversified%20Top-K%20Clique%20Search.pdf","source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1546313639.pdf"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W112063162","https://openalex.org/W1567562836","https://openalex.org/W1676999057","https://openalex.org/W1963605141","https://openalex.org/W1970187347","https://openalex.org/W1983365058","https://openalex.org/W1993320088","https://openalex.org/W1995913408","https://openalex.org/W1996760769","https://openalex.org/W1997959284","https://openalex.org/W1998341696","https://openalex.org/W2011039300","https://openalex.org/W2012720017","https://openalex.org/W2019196387","https://openalex.org/W2023536175","https://openalex.org/W2024766516","https://openalex.org/W2026320281","https://openalex.org/W2028902195","https://openalex.org/W2038142281","https://openalex.org/W2046112356","https://openalex.org/W2046270811","https://openalex.org/W2046813095","https://openalex.org/W2076826101","https://openalex.org/W2080312846","https://openalex.org/W2090200605","https://openalex.org/W2097844290","https://openalex.org/W2099799055","https://openalex.org/W2108301529","https://openalex.org/W2111336742","https://openalex.org/W2116007667","https://openalex.org/W2116434582","https://openalex.org/W2129256050","https://openalex.org/W2136576902","https://openalex.org/W2142599626","https://openalex.org/W2143996311","https://openalex.org/W2148372359","https://openalex.org/W2149547418","https://openalex.org/W2153941542","https://openalex.org/W2156206152","https://openalex.org/W2158269779","https://openalex.org/W2160429376","https://openalex.org/W2163508424","https://openalex.org/W2166742555","https://openalex.org/W2167429959","https://openalex.org/W2183091601","https://openalex.org/W2258427920","https://openalex.org/W2401610261","https://openalex.org/W2405847280","https://openalex.org/W2513705630","https://openalex.org/W2571329707","https://openalex.org/W3149604617","https://openalex.org/W3214957292","https://openalex.org/W4285719527","https://openalex.org/W6629103352","https://openalex.org/W6634151878","https://openalex.org/W6637459119","https://openalex.org/W6680204114"],"related_works":["https://openalex.org/W4213050588","https://openalex.org/W2133128623","https://openalex.org/W2219991221","https://openalex.org/W2164837129","https://openalex.org/W1539736381","https://openalex.org/W2186006531","https://openalex.org/W3092261709","https://openalex.org/W2025463213","https://openalex.org/W2154914679","https://openalex.org/W2313469095"],"abstract_inverted_index":{"Maximal":[0],"clique":[1,17,43,65,93,159,189],"enumeration":[2,18],"is":[3,19,47,95,128,133],"a":[4,72,126,170,177],"fundamental":[5],"problem":[6,45],"in":[7,21,35,60,71,84,101,113,144,154],"graph":[8,115,132],"theory":[9],"and":[10,24,81,103,167,204,227,234],"has":[11,163],"been":[12],"extensively":[13],"studied.":[14],"However,":[15,124],"maximal":[16,51,99,142,158,188,202],"time-consuming":[20],"large":[22,30,85],"graphs":[23,219],"always":[25],"returns":[26],"enormous":[27],"cliques":[28,52,100,143,203],"with":[29],"overlaps.":[31],"Motivated":[32],"by":[33,116],"this,":[34],"this":[36,136],"paper,":[37,137],"we":[38,146,184],"study":[39],"the":[40,61,114,118,131,155,208,228,231],"diversified":[41,91],"top-k":[42,50,64,92],"search":[44,66,94],"which":[46,183,222],"to":[48,96,150,198],"find":[49,105],"that":[53,109],"can":[54,67,168],"cover":[55,110],"most":[56,111],"number":[57],"of":[58,74,107,139,157,221,236],"nodes":[59,112],"graph.":[62],"Diversified":[63],"be":[68],"widely":[69],"used":[70],"lot":[73],"applications":[75],"including":[76],"community":[77],"search,":[78],"motif":[79],"discovery,":[80],"anomaly":[82],"detection":[83],"graphs.":[86],"A":[87],"naive":[88],"solution":[89,127],"for":[90],"keep":[97],"all":[98,141,201],"memory":[102,165],"then":[104],"k":[106,152],"them":[108],"using":[117],"approximate":[119],"greedy":[120],"max":[121],"k-cover":[122],"algorithm.":[123,191],"such":[125],"impractical":[129],"when":[130],"large.":[134],"In":[135],"instead":[138],"keeping":[140],"memory,":[145],"devise":[147],"an":[148,186],"algorithm":[149,162],"maintain":[151],"candidates":[153],"process":[156],"enumeration.":[160],"Our":[161],"limited":[164],"footprint":[166],"achieve":[169],"guaranteed":[171],"approximation":[172],"ratio.":[173],"We":[174,192,211],"also":[175],"introduce":[176],"novel":[178],"light-weight":[179],"PNP-Index,":[180],"based":[181],"on":[182,216],"design":[185],"optimal":[187],"maintenance":[190],"further":[193],"explore":[194],"three":[195],"optimization":[196],"strategies":[197],"avoid":[199],"enumerating":[200],"thus":[205],"largely":[206],"reduce":[207],"computational":[209],"cost.":[210],"conduct":[212],"extensive":[213],"performance":[214],"studies":[215],"six":[217],"real":[218],"one":[220],"contains":[223],"0.3":[224],"billion":[225],"edges,":[226],"results":[229],"demonstrate":[230],"high":[232],"efficiency":[233],"effectiveness":[235],"our":[237],"approach.":[238]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}