{"id":"https://openalex.org/W3046691040","doi":"https://doi.org/10.14778/3401960.3401962","title":"KClist++","display_name":"KClist++","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3046691040","doi":"https://doi.org/10.14778/3401960.3401962","mag":"3046691040"},"language":"en","primary_location":{"id":"doi:10.14778/3401960.3401962","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3401960.3401962","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070691706","display_name":"Bintao Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Bintao Sun","raw_affiliation_strings":["The University of Hong Kong, Hong Kong SAR, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Hong Kong, Hong Kong SAR, China","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002266394","display_name":"Maximilien Danisch","orcid":null},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Maximilien Danisch","raw_affiliation_strings":["Sorbonne Universit\u00e9, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9, Paris, France","institution_ids":["https://openalex.org/I39804081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018708584","display_name":"T-H. Hubert Chan","orcid":"https://orcid.org/0000-0002-8340-235X"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"T-H. Hubert Chan","raw_affiliation_strings":["The University of Hong Kong, Hong Kong SAR, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Hong Kong, Hong Kong SAR, China","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057257639","display_name":"Mauro Sozio","orcid":"https://orcid.org/0000-0002-2031-3974"},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mauro Sozio","raw_affiliation_strings":["Telecom Paris, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Telecom Paris, Paris, France","institution_ids":["https://openalex.org/I12356871"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0437,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.92934424,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"13","issue":"10","first_page":"1628","last_page":"1640"},"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.9995999932289124,"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.9995999932289124,"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.9961000084877014,"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.9955000281333923,"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/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6213993430137634},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5970121622085571},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5764276385307312},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.575344979763031},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5260962247848511},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5025691986083984},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4673961102962494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45639723539352417},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4392551779747009},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3930102586746216},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37600067257881165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35582321882247925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3264828324317932},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08821362257003784}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6213993430137634},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5970121622085571},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5764276385307312},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.575344979763031},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5260962247848511},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5025691986083984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4673961102962494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45639723539352417},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4392551779747009},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3930102586746216},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37600067257881165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35582321882247925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3264828324317932},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08821362257003784},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14778/3401960.3401962","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3401960.3401962","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:iris.luiss.it:11385/251382","is_oa":false,"landing_page_url":"https://hdl.handle.net/11385/251382","pdf_url":null,"source":{"id":"https://openalex.org/S4377196446","display_name":"IRIS - Institutional Research Information System (Libera Universit\u00e0 Internazionale degli Studi Sociali Guido Carli)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56441308","host_organization_name":"Libera Universit\u00e0 Internazionale degli Studi Sociali Guido Carli","host_organization_lineage":["https://openalex.org/I56441308"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6782456740","display_name":"Analysis of Financial Transactions for Security","funder_award_id":"ANR-19-LCV1-0005","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W905619","https://openalex.org/W183656749","https://openalex.org/W1555111922","https://openalex.org/W1572663059","https://openalex.org/W1586552957","https://openalex.org/W1823437338","https://openalex.org/W1924929788","https://openalex.org/W1964419312","https://openalex.org/W1968895412","https://openalex.org/W1972558815","https://openalex.org/W2005499394","https://openalex.org/W2012998203","https://openalex.org/W2013414394","https://openalex.org/W2051109346","https://openalex.org/W2054100908","https://openalex.org/W2054560566","https://openalex.org/W2074757518","https://openalex.org/W2115659887","https://openalex.org/W2119757574","https://openalex.org/W2121526866","https://openalex.org/W2153250079","https://openalex.org/W2166136432","https://openalex.org/W2217968126","https://openalex.org/W2259724869","https://openalex.org/W2266714125","https://openalex.org/W2550802162","https://openalex.org/W2605272442","https://openalex.org/W2767952030","https://openalex.org/W2787993231","https://openalex.org/W2997302914","https://openalex.org/W3102523054","https://openalex.org/W3105618966","https://openalex.org/W4292080745"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W1482551403","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2393701947"],"abstract_inverted_index":{"The":[0,24,106],"problem":[1,29,70,109,187],"of":[2,33,52,61,71,78,100,143,145,218,261],"finding":[3,13,72,148],"densest":[4,27,35,107,150,163,185,208],"subgraphs":[5,73],"has":[6],"received":[7],"increasing":[8],"attention":[9],"in":[10,15,55,89,113,152,210,233,264],"recent":[11,126,226],"years":[12],"applications":[14],"biology,":[16],"finance,":[17],"as":[18,20,65],"well":[19],"social":[21,90],"network":[22,91],"analysis.":[23,92],"k":[25,53,81,101,161,169,183,206,231],"-clique":[26,162,184,207],"subgraph":[28,36,45,57,108,151,164,186,209],"is":[30,41,155],"a":[31,44,66,125,149,158,194,225,234,237],"generalization":[32],"the":[34,39,47,50,56,69,134,160,182,204,241,245,259],"problem,":[37],"where":[38],"objective":[40],"to":[42,139,202],"find":[43,104,203],"maximizing":[46],"ratio":[48],"between":[49],"number":[51,60,77],"-cliques":[54,232],"and":[58,178,236],"its":[59],"nodes.":[62],"It":[63],"includes":[64],"special":[67],"case":[68],"with":[74,97,116,224,253],"largest":[75],"average":[76],"triangles":[79],"(":[80],"=":[82,170],"3),":[83],"which":[84],"plays":[85],"an":[86,254],"important":[87],"role":[88],"Moreover,":[93],"algorithms":[94,117,180],"that":[95,198],"deal":[96],"larger":[98],"values":[99],"can":[102,110,137,199],"effectively":[103],"quasi-cliques.":[105],"be":[111,200],"solved":[112],"polynomial":[114],"time":[115],"based":[118,128],"on":[119,129,188],"maximum":[120],"flow,":[121],"linear":[122],"programming":[123],"or":[124],"approach":[127,136,227,263],"convex":[130],"optimization.":[131],"In":[132],"particular,":[133],"latter":[135],"scale":[138],"graphs":[140,154],"containing":[141],"tens":[142],"billions":[144],"edges.":[146],"While":[147],"large":[153,189,265],"no":[156],"longer":[157],"bottleneck,":[159],"remains":[165],"challenging":[166],"even":[167],"when":[168],"3.":[171],"Our":[172,248],"work":[173],"aims":[174],"at":[175],"developing":[176],"near-optimal":[177],"exact":[179],"for":[181,228,244],"real-world":[190,266],"graphs.":[191,213,267],"We":[192],"give":[193],"surprisingly":[195],"simple":[196],"procedure":[197],"employed":[201],"maximal":[205],"large-real":[211],"world":[212],"By":[214],"leveraging":[215],"appealing":[216],"properties":[217],"existing":[219],"results,":[220],"we":[221],"combine":[222],"it":[223],"listing":[229],"all":[230],"graph":[235],"sampling":[238],"scheme,":[239],"obtaining":[240],"state-of-the-art":[242],"approaches":[243],"aforementioned":[246],"problem.":[247],"theoretical":[249],"results":[250],"are":[251],"complemented":[252],"extensive":[255],"experimental":[256],"evaluation":[257],"showing":[258],"effectiveness":[260],"our":[262]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":3}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2020-08-07T00:00:00"}