{"id":"https://openalex.org/W2054496228","doi":"https://doi.org/10.1016/0020-0190(90)90064-5","title":"Linear algorithm for optimal path cover problem on interval graphs","display_name":"Linear algorithm for optimal path cover problem on interval graphs","publication_year":1990,"publication_date":"1990-07-01","ids":{"openalex":"https://openalex.org/W2054496228","doi":"https://doi.org/10.1016/0020-0190(90)90064-5","mag":"2054496228"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(90)90064-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(90)90064-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5063377210","display_name":"Srinivasa R. Arikati","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Srinivasa Rao Arikati","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600036, India","Department of Computer Science and Engineering , Indian Institute of Technology , Madras, 600036, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600036, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Department of Computer Science and Engineering , Indian Institute of Technology , Madras, 600036, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103487617","display_name":"C. Pandu Rangan","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. Pandu Rangan","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600036, India","Department of Computer Science and Engineering , Indian Institute of Technology , Madras, 600036, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600036, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Department of Computer Science and Engineering , Indian Institute of Technology , Madras, 600036, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063377210"],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.4926,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.82296651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"35","issue":"3","first_page":"149","last_page":"153"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9980000257492065,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9954000115394592,"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.7731541395187378},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6585519909858704},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6192336082458496},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.507023811340332},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.500438928604126},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4994516372680664},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4926684498786926},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.4805105924606323},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4676992893218994},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4537217915058136},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4509994387626648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4384644329547882},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4194607734680176},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3846455216407776},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3411393165588379},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24801713228225708},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.16372302174568176}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7731541395187378},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6585519909858704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6192336082458496},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.507023811340332},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.500438928604126},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4994516372680664},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4926684498786926},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.4805105924606323},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4676992893218994},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4537217915058136},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4509994387626648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4384644329547882},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4194607734680176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3846455216407776},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3411393165588379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24801713228225708},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.16372302174568176},{"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.1016/0020-0190(90)90064-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(90)90064-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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":18,"referenced_works":["https://openalex.org/W9957747","https://openalex.org/W96889678","https://openalex.org/W1544811519","https://openalex.org/W1963840573","https://openalex.org/W2011039300","https://openalex.org/W2021568739","https://openalex.org/W2024491681","https://openalex.org/W2053623386","https://openalex.org/W2075920437","https://openalex.org/W2090154053","https://openalex.org/W2143474538","https://openalex.org/W2157110847","https://openalex.org/W2320198223","https://openalex.org/W2622381546","https://openalex.org/W4285719527","https://openalex.org/W6603881796","https://openalex.org/W6632492624","https://openalex.org/W6669617690"],"related_works":["https://openalex.org/W2407722793","https://openalex.org/W2408404065","https://openalex.org/W2028363955","https://openalex.org/W1970625924","https://openalex.org/W3120803488","https://openalex.org/W2126486668","https://openalex.org/W3158426345","https://openalex.org/W4252949575","https://openalex.org/W3206448149","https://openalex.org/W3106943288"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}