{"id":"https://openalex.org/W1969953427","doi":"https://doi.org/10.1002/net.3230200203","title":"Efficient algorithms for finding maximum cliques of an overlap graph","display_name":"Efficient algorithms for finding maximum cliques of an overlap graph","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W1969953427","doi":"https://doi.org/10.1002/net.3230200203","mag":"1969953427"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230200203","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200203","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5103446553","display_name":"Sumio Masuda","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Sumio Masuda","raw_affiliation_strings":["At time of study, was on leave with the Electrical Engineering Department and Systems Research Center at the University of Maryland","Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan"],"affiliations":[{"raw_affiliation_string":"At time of study, was on leave with the Electrical Engineering Department and Systems Research Center at the University of Maryland","institution_ids":[]},{"raw_affiliation_string":"Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102116980","display_name":"Kazuo Nakajima","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kazuo Nakajima","raw_affiliation_strings":["Electrical Engineering Department, Institute for Advanced Computer Studies, and Systems Research Center, University of Maryland, College Park, Maryland 20742"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Institute for Advanced Computer Studies, and Systems Research Center, University of Maryland, College Park, Maryland 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086884093","display_name":"Toshinobu Kashiwabara","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshinobu Kashiwabara","raw_affiliation_strings":["Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan","Now on leave with the Electrical Engineering Department and Institute for Advanced Computer Studies at the University of Maryland"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Now on leave with the Electrical Engineering Department and Institute for Advanced Computer Studies at the University of Maryland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111533475","display_name":"Toshio Fujisawa","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshio Fujisawa","raw_affiliation_strings":["Deceased on December 15, 1988","Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan"],"affiliations":[{"raw_affiliation_string":"Deceased on December 15, 1988","institution_ids":[]},{"raw_affiliation_string":"Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103446553"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.9225,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.84494507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"20","issue":"2","first_page":"157","last_page":"171"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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.9970999956130981,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9710999727249146,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9593999981880188,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.8390014171600342},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6798245906829834},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5958524942398071},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5424064993858337},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5182033181190491},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4453347325325012},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4082297682762146},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3722493350505829},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2368198037147522}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8390014171600342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6798245906829834},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5958524942398071},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5424064993858337},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5182033181190491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4453347325325012},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4082297682762146},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3722493350505829},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2368198037147522}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230200203","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200203","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1973310391","https://openalex.org/W2008836603","https://openalex.org/W2011039300","https://openalex.org/W2025641440","https://openalex.org/W2052850644","https://openalex.org/W2069893028","https://openalex.org/W2077583413","https://openalex.org/W2125837271","https://openalex.org/W2143474538","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W2794565019","https://openalex.org/W2264356384","https://openalex.org/W1561005397","https://openalex.org/W2952246343","https://openalex.org/W1978056388","https://openalex.org/W2016823805","https://openalex.org/W3080928114","https://openalex.org/W2984191194","https://openalex.org/W3121666834","https://openalex.org/W3118640416"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"F":[2,33,66,76,96],"=":[3,54],"{":[4,145],"I":[5,8,11,27,30],"1":[6],",":[7,57],"2":[9],",\u2026,":[10],"n":[12,127,139,142,147,181,184],"}":[13],"be":[14],"a":[15,70,124,133,164],"finite":[16],"family":[17,125],"of":[18,46,112,123,126,156,163,168,196],"closed":[19],"intervals":[20,26,94],"on":[21],"the":[22,49,92,121,154,161,169,193],"real":[23],"line.":[24],"Two":[25],"j":[28],"and":[29,75,89,158],"k":[31],"in":[32,81,95,120,136,178],"are":[34,83],"said":[35],"to":[36,85],"overlap":[37,63,97,114],"each":[38,86,98],"other":[39,87],"if":[40,67,88,91],"they":[41],"intersect":[42],"but":[43],"neither":[44],"one":[45],"them":[47],"contains":[48],"other.":[50,99],"A":[51],"graph":[52,64,115],"G":[53],"(":[55,138,180],"V":[56,74,82],"E":[58],")":[59],"is":[60,69,118,153,160,192],"called":[61],"an":[62,113],"for":[65,108],"there":[68],"one\u2010to\u2010one":[71],"correspondence":[72],"between":[73],"such":[77],"that":[78],"two":[79,105],"vertices":[80],"adjacent":[84],"only":[90],"corresponding":[93],"In":[100],"this":[101],"paper,":[102],"we":[103],"present":[104],"efficient":[106],"algorithms":[107],"finding":[109],"maximum":[110,134,165,176],"cliques":[111,177],"when":[116],"it":[117],"given":[119],"form":[122],"intervals.":[128],"The":[129,171],"first":[130],"algorithm":[131,173],"finds":[132],"clique":[135],"O":[137,179],".":[140],"log":[141,183],"+":[143,185,187],"Min":[144],"m,":[146],"\u2010":[148,182],"\u03c9})":[149],"time,":[150,189],"where":[151,190],"m":[152,186],"number":[155],"edges":[157],"\u03c9":[159],"size":[162],"clique,":[166],"respectively,":[167],"graph.":[170],"second":[172],"generates":[174],"all":[175],"\u03b3)":[188],"\u03b3":[191],"total":[194],"sum":[195],"their":[197],"sizes.":[198]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}