{"id":"https://openalex.org/W2026697373","doi":"https://doi.org/10.1002/net.3230210205","title":"Polynomial time algorithms on circular\u2010arc overlap graphs","display_name":"Polynomial time algorithms on circular\u2010arc overlap graphs","publication_year":1991,"publication_date":"1991-03-01","ids":{"openalex":"https://openalex.org/W2026697373","doi":"https://doi.org/10.1002/net.3230210205","mag":"2026697373"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230210205","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210205","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/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":true,"raw_author_name":"Toshinobu Kashiwabara","raw_affiliation_strings":["Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan","T. Kashiwabara was on leave from Osaka University, with the Electrical Engineering Department and Institute for Advanced Computer Studies, The University of Maryland, College Park, MD 20742"],"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":"T. Kashiwabara was on leave from Osaka University, with the Electrical Engineering Department and Institute for Advanced Computer Studies, The University of Maryland, College Park, MD 20742","institution_ids":[]}]},{"author_position":"middle","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":false,"raw_author_name":"Sumio Masuda","raw_affiliation_strings":["Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan"],"affiliations":[{"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":"last","author":{"id":"https://openalex.org/A5111533475","display_name":"Toshio Fujisawa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toshio Fujisawa","raw_affiliation_strings":["T. Fujisawa was with the Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan. He is now deceased"],"affiliations":[{"raw_affiliation_string":"T. Fujisawa was with the Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan. He is now deceased","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5086884093"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.15836627,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"2","first_page":"195","last_page":"203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.9987999796867371,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9925000071525574,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7783161401748657},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.7213047742843628},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.646092414855957},{"id":"https://openalex.org/keywords/circle-graph","display_name":"Circle graph","score":0.6345375776290894},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5417592525482178},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5255569219589233},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4474383592605591},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42561596632003784},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38160884380340576},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.29546353220939636},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.224887877702713},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21712231636047363},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.20396661758422852},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.18289679288864136}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7783161401748657},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.7213047742843628},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.646092414855957},{"id":"https://openalex.org/C171528893","wikidata":"https://www.wikidata.org/wiki/Q5121450","display_name":"Circle graph","level":5,"score":0.6345375776290894},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5417592525482178},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5255569219589233},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4474383592605591},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42561596632003784},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38160884380340576},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.29546353220939636},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.224887877702713},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21712231636047363},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.20396661758422852},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.18289679288864136}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230210205","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210205","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1480290975","https://openalex.org/W1969953427","https://openalex.org/W1971937941","https://openalex.org/W1973310391","https://openalex.org/W1984346383","https://openalex.org/W2008836603","https://openalex.org/W2048237851","https://openalex.org/W2049520215","https://openalex.org/W2052850644","https://openalex.org/W2057405567","https://openalex.org/W2071867466","https://openalex.org/W2132748590","https://openalex.org/W2143474538","https://openalex.org/W2320198223","https://openalex.org/W4232336108","https://openalex.org/W4361867857"],"related_works":["https://openalex.org/W2097999883","https://openalex.org/W2044762907","https://openalex.org/W4232461730","https://openalex.org/W2090708733","https://openalex.org/W1965463345","https://openalex.org/W2021754931","https://openalex.org/W2048237851","https://openalex.org/W1984545818","https://openalex.org/W2127294000","https://openalex.org/W3022162048"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"S":[2,23,34,51],"be":[3],"a":[4,9,18,28,75,83,92,108],"family":[5,84],"of":[6,56,82,85],"arcs":[7,49],"on":[8,70],"circle.":[10],"A":[11],"graph":[12,21,78],"G":[13],"=":[14],"(V,E)":[15],"is":[16,27],"called":[17],"circular\u2010arc":[19,71,76],"overlap":[20,72,77],"for":[22],"if":[24,43,46],"(i)":[25],"there":[26],"one\u2010to\u2010one":[29],"correspondence":[30],"between":[31],"V":[32,40],"and":[33,35,44,103],"(ii)":[36],"two":[37,66],"vertices":[38],"in":[39,50,79,96,111],"are":[41],"adjacent":[42],"only":[45],"the":[47,59,80,88,104],"corresponding":[48],"intersect":[52],"but":[53],"neither":[54],"one":[55,106],"them":[57],"contains":[58],"other.":[60],"In":[61],"this":[62],"article,":[63],"we":[64],"present":[65],"polynomial":[67],"time":[68,102],"algorithms":[69],"graphs.":[73],"Given":[74],"form":[81],"n":[86,99,114],"arcs,":[87],"first":[89],"algorithm":[90],"obtains":[91],"maximum":[93,109],"independent":[94],"set":[95],"O":[97,112],"(":[98,113],"2":[100],")":[101,116],"second":[105],"finds":[107],"clique":[110],"5":[115],"time.":[117]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}