{"id":"https://openalex.org/W2013507147","doi":"https://doi.org/10.1145/170791.170879","title":"An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs","display_name":"An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs","alternate_titles":[],"publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2013507147","doi":"https://doi.org/10.1145/170791.170879","mag":"2013507147"},"language":"en","primary_location":{"id":"doi:10.1145/170791.170879","doi":"https://doi.org/10.1145/170791.170879","is_oa":false,"landing_page_url":"https://doi.org/10.1145/170791.170879","pdf_url":null,"source":{"id":"https://openalex.org/S7407087687","display_name":"ACM Annual Conference on Computer Science (CSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1993 ACM conference on Computer science - CSC '93","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2013507147"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5103229709","display_name":"Y. Daniel Liang","orcid":"https://orcid.org/0009-0007-0331-9622","observed_orcids":["https://orcid.org/0009-0007-0331-9622"]},"institutions":[{"id":"https://openalex.org/I162817326","display_name":"Indiana University \u2013 Purdue University Fort Wayne","ror":"https://ror.org/01jxzq227","country_code":"US","type":"education","lineage":["https://openalex.org/I162817326"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Y. Daniel Liang","raw_affiliation_strings":["Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN","institution_ids":["https://openalex.org/I162817326"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031865197","display_name":"Glenn K. Manacher","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"G. K. Manacher","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL","Dept. of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL","institution_ids":["https://openalex.org/I39422238"]},{"raw_affiliation_string":"Dept. of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL#TAB#","institution_ids":["https://openalex.org/I39422238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2768,"has_fulltext":false,"cited_by_count":6,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.36809269,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"390","last_page":"397"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.538100004196167,"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.538100004196167,"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.4587000012397766,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.00039999998989515007,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/circular-arc-graphs","display_name":"circular-arc graphs","score":0.9990000128746033},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7549999952316284},{"id":"https://openalex.org/keywords/o-n-log-n-time-complexity","display_name":"O(n log n) time complexity","score":0.7289999723434448}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7371839880943298},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.7351392507553101},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6632886528968811},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6479381322860718},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5790919661521912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5741280317306519},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5509230494499207},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.511076807975769},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4773678481578827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44750508666038513},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.42554253339767456},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3785553574562073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28135836124420166},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2607080340385437},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1936827003955841},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.1829967498779297},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0615043044090271},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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.1145/170791.170879","doi":"https://doi.org/10.1145/170791.170879","is_oa":false,"landing_page_url":"https://doi.org/10.1145/170791.170879","pdf_url":null,"source":{"id":"https://openalex.org/S7407087687","display_name":"ACM Annual Conference on Computer Science (CSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1993 ACM conference on Computer science - CSC '93","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1963840573","https://openalex.org/W2011039300","https://openalex.org/W2054496228","https://openalex.org/W2075920437","https://openalex.org/W2090154053","https://openalex.org/W2096399406","https://openalex.org/W2143474538","https://openalex.org/W2157110847"],"related_works":["https://openalex.org/W2013817894","https://openalex.org/W2763025185","https://openalex.org/W2802197750","https://openalex.org/W2036803675","https://openalex.org/W2171581997","https://openalex.org/W2006048213","https://openalex.org/W7070346653","https://openalex.org/W2021348471","https://openalex.org/W135873465","https://openalex.org/W1547367345"],"abstract_inverted_index":{"Whether":[0],"there":[1],"exists":[2],"a":[3,22,28,33,39],"polynomial":[4,23],"algorithm":[5,25,43],"for":[6,26,32],"the":[7],"minimal":[8,29],"path":[9,30],"cover":[10,31],"problem":[11],"in":[12,38],"circular-arc":[13,40],"graphs":[14],"remains":[15],"open.":[16],"In":[17],"this":[18],"paper,":[19],"we":[20],"present":[21],"time":[24],"finding":[27],"set":[34],"of":[35],"n":[36],"arcs":[37],"model.":[41],"Our":[42],"takes":[44],"\u039f(nlogn)":[45],"time.":[46]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2013507147","counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
