{"id":"https://openalex.org/W2587032883","doi":"https://doi.org/10.1137/140981265","title":"A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs","display_name":"A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2587032883","doi":"https://doi.org/10.1137/140981265","mag":"2587032883"},"language":"en","primary_location":{"id":"doi:10.1137/140981265","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140981265","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5078996494","display_name":"Peng Li","orcid":"https://orcid.org/0000-0002-3092-9692"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peng Li","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010329446","display_name":"Yaokun Wu","orcid":"https://orcid.org/0000-0002-6811-7067"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yaokun Wu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078996494"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4542,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.62747109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"1","first_page":"210","last_page":"239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9957000017166138,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9890999794006348,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.784696102142334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7295510172843933},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6544091701507568},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5927695035934448},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5740585327148438},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5690345168113708},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4830208718776703},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.48240387439727783},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4632951021194458},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46212220191955566},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4553416967391968},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4405863285064697},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.41579416394233704},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4145486354827881},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3436606526374817},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3209646940231323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1691407561302185},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15983012318611145}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.784696102142334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7295510172843933},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6544091701507568},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5927695035934448},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5740585327148438},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5690345168113708},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4830208718776703},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.48240387439727783},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4632951021194458},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46212220191955566},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4553416967391968},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4405863285064697},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.41579416394233704},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4145486354827881},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3436606526374817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3209646940231323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1691407561302185},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15983012318611145},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/140981265","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140981265","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2417611990","display_name":null,"funder_award_id":"11671258","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G3932308834","display_name":null,"funder_award_id":"11271255","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1502434717","https://openalex.org/W1813313303","https://openalex.org/W1978041641","https://openalex.org/W1986137691","https://openalex.org/W1998389851","https://openalex.org/W2023957019","https://openalex.org/W2024491681","https://openalex.org/W2053623386","https://openalex.org/W2054496228","https://openalex.org/W2060774395","https://openalex.org/W2072212337","https://openalex.org/W2106934213","https://openalex.org/W2107226487","https://openalex.org/W2119014043","https://openalex.org/W2133847446","https://openalex.org/W2147102683","https://openalex.org/W2949741977"],"related_works":["https://openalex.org/W2036594069","https://openalex.org/W4244658307","https://openalex.org/W2156896570","https://openalex.org/W2949255922","https://openalex.org/W2038655901","https://openalex.org/W4241472005","https://openalex.org/W2383239740","https://openalex.org/W2027513055","https://openalex.org/W101378340","https://openalex.org/W1588220234"],"abstract_inverted_index":{"Let":[0],"$G$":[1,27,34],"be":[2],"an":[3,58],"interval":[4,72],"graph":[5,76],"and":[6,35],"take":[7],"one":[8,39],"of":[9,22,26,33,40,55,64,71],"its":[10],"vertices":[11],"$x$.":[12],"Can":[13],"we":[14,60],"find":[15],"in":[16],"linear":[17],"time":[18],"a":[19,46],"minimum":[20],"number":[21],"vertex":[23,31],"disjoint":[24],"paths":[25],"which":[28],"cover":[29],"the":[30,53,62,68],"set":[32],"have":[36],"$x$":[37],"as":[38],"their":[41],"endpoints?":[42],"This":[43],"paper":[44],"provides":[45],"positive":[47],"answer":[48],"to":[49],"this":[50],"problem.":[51],"In":[52],"course":[54],"developing":[56],"such":[57],"algorithm,":[59],"explore":[61],"possibility":[63],"getting":[65],"insight":[66],"on":[67],"path":[69],"structure":[70],"graphs":[73],"via":[74],"greedy":[75],"searches.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}