{"id":"https://openalex.org/W2125837271","doi":"https://doi.org/10.1002/net.3230110305","title":"Finding maximum cliques in circle graphs","display_name":"Finding maximum cliques in circle graphs","publication_year":1981,"publication_date":"1981-09-01","ids":{"openalex":"https://openalex.org/W2125837271","doi":"https://doi.org/10.1002/net.3230110305","mag":"2125837271"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230110305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110305","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/A5064469896","display_name":"Doron Rotem","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"D. Rotem","raw_affiliation_strings":["Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L361"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L361","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068857927","display_name":"Jorge Urrutia","orcid":"https://orcid.org/0000-0002-4158-5979"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Urrutia","raw_affiliation_strings":["Department of Combinatorics and Optimization","Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L361"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L361","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064469896"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.0705,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.92389701,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"11","issue":"3","first_page":"269","last_page":"278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9969000220298767,"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.7776819467544556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5683781504631042},{"id":"https://openalex.org/keywords/circle-graph","display_name":"Circle graph","score":0.5546122789382935},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.538817822933197},{"id":"https://openalex.org/keywords/chord","display_name":"Chord (peer-to-peer)","score":0.49895167350769043},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47196662425994873},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4498884677886963},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40128952264785767},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32821521162986755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28817689418792725},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.26279306411743164},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2099568247795105}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7776819467544556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5683781504631042},{"id":"https://openalex.org/C171528893","wikidata":"https://www.wikidata.org/wiki/Q5121450","display_name":"Circle graph","level":5,"score":0.5546122789382935},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.538817822933197},{"id":"https://openalex.org/C194147245","wikidata":"https://www.wikidata.org/wiki/Q1076368","display_name":"Chord (peer-to-peer)","level":2,"score":0.49895167350769043},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47196662425994873},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4498884677886963},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40128952264785767},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32821521162986755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28817689418792725},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.26279306411743164},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2099568247795105},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230110305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110305","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W45625111","https://openalex.org/W2022971294","https://openalex.org/W2033520777","https://openalex.org/W2052850644","https://openalex.org/W2069893028","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W4235936977"],"related_works":["https://openalex.org/W2044762907","https://openalex.org/W2097999883","https://openalex.org/W4232461730","https://openalex.org/W2090708733","https://openalex.org/W2048237851","https://openalex.org/W1819739797","https://openalex.org/W2052850644","https://openalex.org/W1965463345","https://openalex.org/W4390437815","https://openalex.org/W2125837271"],"abstract_inverted_index":{"Abstract":[0],"A":[1,43],"circle":[2,7,49,57],"diagram":[3,16],"consists":[4],"of":[5,12,88],"a":[6,10,18,28,48],"C":[8,41],"and":[9,30],"set":[11],"n":[13,21],"chords.":[14],"This":[15,102],"defines":[17],"graph":[19,44,50],"with":[20,105],"vertices":[22,32],"where":[23,85],"each":[24,93],"vertex":[25],"corresponds":[26],"to":[27,67,80,91],"chord,":[29],"two":[31],"are":[33],"adjacent":[34],"if":[35,51],"their":[36],"corresponding":[37],"chords":[38],"intersect":[39],"in":[40,99,111],".":[42],"G":[45],"is":[46,53,72,97],"called":[47],"it":[52],"defined":[54],"by":[55],"some":[56],"diagram.":[58],"An":[59],"algorithm":[60,75,107],"which":[61,109],"requires":[62],"O(n":[63,112],"2":[64],")":[65,114],"steps":[66,89],"generate":[68,81,92],"one":[69],"maximum":[70,83,95],"clique":[71,96],"presented.":[73],"The":[74],"can":[76],"also":[77],"be":[78],"used":[79],"all":[82],"cliques":[84],"the":[86],"number":[87],"need":[90],"additional":[94],"linear":[98],"its":[100],"size.":[101],"compares":[103],"favourably":[104],"Gavril's":[106],"[4]":[108],"works":[110],"3":[113],"steps.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}