{"id":"https://openalex.org/W2010504820","doi":"https://doi.org/10.1145/1597036.1597044","title":"Enumeration of isolated cliques and pseudo-cliques","display_name":"Enumeration of isolated cliques and pseudo-cliques","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2010504820","doi":"https://doi.org/10.1145/1597036.1597044","mag":"2010504820"},"language":"en","primary_location":{"id":"doi:10.1145/1597036.1597044","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1597036.1597044","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","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/A5031213478","display_name":"Hiro Ito","orcid":"https://orcid.org/0000-0001-6975-0422"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiro Ito","raw_affiliation_strings":["Kyoto University, Kyoto, Japan","Kyoto University, Kyoto, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]},{"raw_affiliation_string":"Kyoto University, Kyoto, Japan#TAB#","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062918669","display_name":"Kazuo Iwama","orcid":"https://orcid.org/0000-0002-5339-0669"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kazuo Iwama","raw_affiliation_strings":["Kyoto University, Kyoto, Japan","Kyoto University, Kyoto, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]},{"raw_affiliation_string":"Kyoto University, Kyoto, Japan#TAB#","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":null,"apc_paid":null,"fwci":2.7774,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.89752413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"5","issue":"4","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9087198972702026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.746792733669281},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.7038671970367432},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5678895711898804},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5474342703819275},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5448969602584839},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5074149966239929},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.48680374026298523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4343387484550476},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43271711468696594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0620613694190979}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9087198972702026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.746792733669281},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7038671970367432},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5678895711898804},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5474342703819275},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5448969602584839},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5074149966239929},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.48680374026298523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4343387484550476},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43271711468696594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0620613694190979},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1597036.1597044","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1597036.1597044","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1501644705","https://openalex.org/W1522854417","https://openalex.org/W1551538598","https://openalex.org/W1600450150","https://openalex.org/W1868111879","https://openalex.org/W1984374364","https://openalex.org/W2013568176","https://openalex.org/W2020423193","https://openalex.org/W2024380444","https://openalex.org/W2027048490","https://openalex.org/W2032279394","https://openalex.org/W2036836182","https://openalex.org/W2061513598","https://openalex.org/W2081254453","https://openalex.org/W2082603400","https://openalex.org/W2115659887","https://openalex.org/W2153952206","https://openalex.org/W2160429376","https://openalex.org/W2167403283","https://openalex.org/W2257654380","https://openalex.org/W2260474806","https://openalex.org/W2607539118","https://openalex.org/W2800613862","https://openalex.org/W2913688336","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W4300125793","https://openalex.org/W2578985712","https://openalex.org/W2406961474","https://openalex.org/W2143566611","https://openalex.org/W2013740965","https://openalex.org/W588267724","https://openalex.org/W2952598754","https://openalex.org/W2026779193","https://openalex.org/W2497378183"],"abstract_inverted_index":{"In":[0,106],"this":[1,79],"article,":[2],"we":[3,89,109,150,192,363],"consider":[4],"isolated":[5,8,68,377],"cliques":[6,96,134,164,184,236,274],"and":[7,120,123,171,223,261,296,328,340,351,419],"dense":[9],"subgraphs.":[10],"For":[11,380],"a":[12,17,84,98,113,124,158,218,256,297,306,329,357,387,423],"given":[13,114],"graph":[14,115,219,257,388],"G":[15,29,40,116],",":[16,88,129,408,437],"vertex":[18],"subset":[19],"S":[20,31,42],"of":[21,117,220,230,258,268,287,324,332,360,373,375,389,396],"size":[22],"k":[23,369,400,403,409,411,433,436,438,440],"(and":[24],"also":[25],"its":[26,47],"induced":[27,316],"subgraph":[28,65,315],"(":[30,41,141,203,232,247,270,399,432],"))":[32],"is":[33,44,57,73,157,206,217,237,255,275,305,370,386,417,422],"said":[34],"to":[35,46],"be":[36,136,166,186,346],"c":[37,56,87,93,128,131,142,156,161,174,181,429,445],"-isolated":[38,94,132,162,182,430],"if":[39,69,101,155,173,201,245],")":[43,205,249,404,412,416],"connected":[45],"outside":[48],"via":[49],"less":[50],"than":[51],"ck":[52],"edges.":[53],"The":[54,64,75],"number":[55,127,229,267,359,372,395],"sometimes":[58],"called":[59],"the":[60,70,228,266,285,314,365,371,376,394],"isolation":[61,71],"factor":[62,72],".":[63,243,281,446],"appears":[66],"more":[67,107],"smaller.":[74],"main":[76],"result":[77],"in":[78,103,138,168,188,239,277,348],"work":[80],"shows":[81],"that":[82,194,313,344,355],"for":[83,112,226,264,392,442],"fixed":[85],"constant":[86,444],"can":[90,135,151,165,185,345],"enumerate":[91],"all":[92,130,160,180,428],"maximal":[95,133,163,183,235,273],"(including":[97],"maximum":[99],"one,":[100],"any)":[102],"linear":[104,169],"time.":[105,190],"detail,":[108],"show":[110,193,364],"that,":[111],"n":[118,178,204,221,233,240,248,252,259,271,278,390],"vertices":[119,222,260,374,391],"m":[121,146,224,242,262,280],"edges,":[122],"positive":[125],"real":[126],"enumerated":[137,167,187],"time":[139,350],"O":[140,176],"4":[143],"2":[144],"2c":[145],").":[147],"From":[148],"this,":[149],"see":[152],"that:":[153],"(1)":[154,379],"constant,":[159,214],"time,":[170],"(2)":[172,420],"=":[175,250],"(log":[177,402],"),":[179,253,441],"polynomial":[189,349],"Moreover,":[191],"these":[195],"bounds":[196],"are":[197],"tight.":[198],"That":[199],"is,":[200],"f":[202,231,246,269],"an":[207,292,321],"increasing":[208],"function":[209],"not":[210],"bounded":[211],"by":[212,302,317],"any":[213,381,443],"then":[215],"there":[216,254,385,421],"edges":[225,263],"which":[227,265,393,426],")-isolated":[234,272],"superlinear":[238],"+":[241,279,406,414],"Furthermore,":[244],"\u03c9(log":[251],"superpolynomial":[276,358],"We":[282],"next":[283],"introduce":[284],"idea":[286],"pseudo-cliques.":[288],"A":[289],"pseudo-clique":[290],"having":[291],"average":[293,322],"degree":[294,299,323,331],"\u03b1":[295,327],"minimum":[298,330],"\u03b2,":[300],"denoted":[301],"PC":[303,398,431],"(\u03b1,\u03b2),":[304],"set":[307],"V":[308,311,318],"\u2032":[309,319],"\u2286":[310],"such":[312],"has":[320],"at":[325,333],"least":[326,334],"\u03b2.":[335],"This":[336],"article":[337],"investigates":[338],"these,":[339],"obtains":[341],"some":[342,352],"cases":[343,354],"solved":[347],"other":[353],"have":[356],"solutions.":[361],"Especially,":[362],"following":[366],"results,":[367],"where":[368],"pseudo-cliques:":[378],"\u03f5":[382,407,415],">":[383],"0":[384],"1-isolated":[397],"-":[401,434],"1":[405,413],"/(log":[410],"superpolynomial,":[418],"polynomial-time":[424],"algorithm":[425],"enumerates":[427],"log":[435],"/log":[439]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}