{"id":"https://openalex.org/W2071867466","doi":"https://doi.org/10.1137/0217003","title":"An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph","display_name":"An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph","publication_year":1988,"publication_date":"1988-02-01","ids":{"openalex":"https://openalex.org/W2071867466","doi":"https://doi.org/10.1137/0217003","mag":"2071867466"},"language":"en","primary_location":{"id":"doi:10.1137/0217003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/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":true,"raw_author_name":"Sumio Masuda","raw_affiliation_strings":["University of Maryland, College Park"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","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":["University of Maryland, College Park"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103446553"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":7.218,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.97746524,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"1","first_page":"41","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9944000244140625,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6749401092529297},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6458320021629333},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.6260417699813843},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6075953841209412},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5224560499191284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4910123646259308},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4321586489677429},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4295097589492798},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40388208627700806},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2536547780036926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2179352343082428},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.19291460514068604},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1061476469039917}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6749401092529297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6458320021629333},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6260417699813843},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6075953841209412},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5224560499191284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4910123646259308},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4321586489677429},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4295097589492798},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40388208627700806},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2536547780036926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2179352343082428},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.19291460514068604},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1061476469039917},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0217003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":14,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1761548667","https://openalex.org/W1980392938","https://openalex.org/W2012970601","https://openalex.org/W2024491681","https://openalex.org/W2025641440","https://openalex.org/W2048237851","https://openalex.org/W2049520215","https://openalex.org/W2053623386","https://openalex.org/W2074937107","https://openalex.org/W2077583413","https://openalex.org/W2089081330","https://openalex.org/W2089651609","https://openalex.org/W2320198223"],"related_works":["https://openalex.org/W3003449463","https://openalex.org/W2963989216","https://openalex.org/W1997613377","https://openalex.org/W2804969619","https://openalex.org/W3021108537","https://openalex.org/W4301100693","https://openalex.org/W2905396358","https://openalex.org/W2789598654","https://openalex.org/W2964258819","https://openalex.org/W2048217665"],"abstract_inverted_index":{"A":[0],"new":[1],"algorithm":[2,30,57],"is":[3,18,58],"presented":[4],"for":[5],"finding":[6],"a":[7,12,24,64],"maximum":[8],"independent":[9],"set":[10],"of":[11,23,26,45],"circular-arc":[13],"graph.":[14],"When":[15],"the":[16,21,43,46],"graph":[17],"given":[19],"in":[20,53],"form":[22],"family":[25],"n":[27],"arcs,":[28],"our":[29],"requires":[31],"only":[32],"$O(n":[33],"\\cdot":[34],"\\log":[35],"n)$":[36],"time":[37],"and":[38,60],"$O(n)$":[39,54],"space.":[40],"Furthermore,":[41],"if":[42],"endpoints":[44],"arcs":[47],"are":[48],"already":[49],"sorted,":[50],"it":[51],"runs":[52],"time.":[55],"This":[56],"time-":[59],"space-optimal":[61],"to":[62],"within":[63],"constant":[65],"factor.":[66]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2014,"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"}