{"id":"https://openalex.org/W2916274160","doi":"https://doi.org/10.1109/glocom.2018.8647563","title":"Maximal Labelled-Clique and Click-Biclique Problems for Networked Community Detection","display_name":"Maximal Labelled-Clique and Click-Biclique Problems for Networked Community Detection","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2916274160","doi":"https://doi.org/10.1109/glocom.2018.8647563","mag":"2916274160"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2018.8647563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5077953904","display_name":"Debajyoti Bera","orcid":"https://orcid.org/0000-0002-1626-7514"},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]},{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Debajyoti Bera","raw_affiliation_strings":["IIIT-Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIIT-Delhi, New Delhi, India","institution_ids":["https://openalex.org/I119939252","https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055238253","display_name":"Flavio Esposito","orcid":"https://orcid.org/0000-0002-7798-4584"},"institutions":[{"id":"https://openalex.org/I47838141","display_name":"Saint Louis University","ror":"https://ror.org/01p7jjy08","country_code":"US","type":"education","lineage":["https://openalex.org/I47838141"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Flavio Esposito","raw_affiliation_strings":["Computer Science Department, Saint Louis University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Saint Louis University, USA","institution_ids":["https://openalex.org/I47838141"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007226395","display_name":"Meghana Pendyala","orcid":"https://orcid.org/0000-0003-2968-1746"},"institutions":[{"id":"https://openalex.org/I47838141","display_name":"Saint Louis University","ror":"https://ror.org/01p7jjy08","country_code":"US","type":"education","lineage":["https://openalex.org/I47838141"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Meghan Pendyala","raw_affiliation_strings":["Computer Science Department, Saint Louis University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Saint Louis University, USA","institution_ids":["https://openalex.org/I47838141"]}]}],"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":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9603999853134155,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8168325424194336},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.7734004259109497},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.7518287897109985},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.7214713096618652},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5796448588371277},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49289941787719727},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.4495962858200073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4201529622077942},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3998171389102936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39198583364486694},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37647491693496704},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36195677518844604},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07290753722190857}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8168325424194336},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7734004259109497},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.7518287897109985},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7214713096618652},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5796448588371277},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49289941787719727},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.4495962858200073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4201529622077942},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3998171389102936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39198583364486694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37647491693496704},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36195677518844604},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07290753722190857},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2018.8647563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W166336717","https://openalex.org/W1584510240","https://openalex.org/W2023954353","https://openalex.org/W2036512590","https://openalex.org/W2064695611","https://openalex.org/W2079284623","https://openalex.org/W2116007667","https://openalex.org/W2118433174","https://openalex.org/W2160429376","https://openalex.org/W2164928285","https://openalex.org/W2543698218"],"related_works":["https://openalex.org/W2174899211","https://openalex.org/W2091826982","https://openalex.org/W4400909662","https://openalex.org/W2036057584","https://openalex.org/W3022526073","https://openalex.org/W4246000090","https://openalex.org/W2107875203","https://openalex.org/W4234658180","https://openalex.org/W3098480989","https://openalex.org/W2916274160"],"abstract_inverted_index":{"Discovering":[0],"\"closely":[1],"related":[2],"entities\"":[3],"in":[4,34,83,88,123,198],"any":[5,72],"network,":[6],"a.k.a.":[7],"communities,":[8],"is":[9,42,54,64,68,145],"a":[10,43,52,55,65,104,124],"key":[11],"goal":[12],"for":[13,134],"various":[14],"network":[15],"analytic":[16],"applications.":[17],"In":[18,95],"particular,":[19],"cliques":[20,82,161,191],"and":[21,32,37,50,139,153,162,173,182,192],"bicliques":[22,87,193],"are":[23],"two":[24,132],"community":[25],"structures":[26],"that":[27,67,107,185],"have":[28,91],"influenced":[29],"several":[30],"tools":[31],"techniques":[33],"Big":[35],"Data":[36],"social":[38],"networking.":[39],"A":[40,59],"clique":[41,61,66,74,151],"complete":[44,56],"subgraph":[45],"of":[46,71,127,148,159,179,201],"an":[47,146,167],"undirected":[48],"graph":[49],"similarly,":[51],"biclique":[53],"bipartite":[57,89],"subgraph.":[58],"maximal":[60,81,137,140,150,160,163],"(or":[62,75],"biclique)":[63],"not":[69],"subset":[70],"other":[73],"biclique).":[76],"Algorithms":[77],"to":[78,114,120,176,190],"list":[79],"all":[80],"general":[84],"graphs":[85,90],"or":[86],"been":[92],"previously":[93],"studied.":[94],"this":[96],"paper,":[97],"we":[98,108,183],"enhance":[99],"these":[100],"solutions":[101],"explaining":[102],"how":[103],"novel":[105],"structure,":[106],"call":[109],"clique-biclique":[110],"can":[111,194],"be":[112,195],"used":[113],"unravel":[115],"richer":[116,187],"communities":[117,188],"with":[118],"respect":[119],"different":[121,171],"problems":[122],"wide":[125],"variety":[126],"networks.":[128],"We":[129,165],"then":[130],"give":[131],"algorithms":[133],"efficiently":[135,196],"listing":[136],"labelled-cliques":[138],"clique-bicliques.":[141],"The":[142],"first":[143],"algorithm":[144],"extension":[147],"the":[149,154,180],"enumeration":[152,158],"second":[155],"cleverly":[156],"combines":[157],"bicliques.":[164],"conduct":[166],"experimental":[168],"analysis":[169],"over":[170],"synthetic":[172],"real":[174],"datasets":[175],"evaluate":[177],"performance":[178],"algorithms,":[181],"found":[184,197],"even":[186],"compared":[189],"most":[199],"networks":[200],"interest.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}