{"id":"https://openalex.org/W2068710139","doi":"https://doi.org/10.1016/s0166-218x(97)00012-7","title":"k-Path partitions in trees","display_name":"k-Path partitions in trees","publication_year":1997,"publication_date":"1997-10-01","ids":{"openalex":"https://openalex.org/W2068710139","doi":"https://doi.org/10.1016/s0166-218x(97)00012-7","mag":"2068710139"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(97)00012-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(97)00012-7","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied 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/A5083503633","display_name":"Jing\u2010Ho Yan","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jing-Ho Yan","raw_affiliation_strings":["Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050, Taiwan","Department of Applied Mathematics National Chiao Tung University Hsinchu 30050, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Applied Mathematics National Chiao Tung University Hsinchu 30050, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002508116","display_name":"Gerard J. Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Gerard J. Chang","raw_affiliation_strings":["Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050, Taiwan","Department of Applied Mathematics National Chiao Tung University Hsinchu 30050, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Applied Mathematics National Chiao Tung University Hsinchu 30050, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111873665","display_name":"Sandra M. Hedetniemi","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sandra M. Hedetniemi","raw_affiliation_strings":["Department of Computer Science, Clemson University, Clemson, SC 29634-1906, USA","Department of Computer Science , Clemson University , Clemson, SC, 29634-1906, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Clemson University, Clemson, SC 29634-1906, USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"Department of Computer Science , Clemson University , Clemson, SC, 29634-1906, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Sandra M. Hedetniemi","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sandra M. Hedetniemi","raw_affiliation_strings":["Department of Computer Science, Clemson University, Clemson, SC 29634-1906, USA","Department of Computer Science , Clemson University , Clemson, SC, 29634-1906, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Clemson University, Clemson, SC 29634-1906, USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"Department of Computer Science , Clemson University , Clemson, SC, 29634-1906, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":null,"display_name":"stephen T. Hedetniemi","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"stephen T. Hedetniemi","raw_affiliation_strings":["Department of Computer Science, Clemson University, Clemson, SC 29634-1906, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Clemson University, Clemson, SC 29634-1906, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"last","author":{"id":null,"display_name":"stephen T. Hedetniemi","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"stephen T. Hedetniemi","raw_affiliation_strings":["Department of Computer Science, Clemson University, Clemson, SC 29634-1906, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Clemson University, Clemson, SC 29634-1906, USA","institution_ids":["https://openalex.org/I8078737"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111873665"],"corresponding_institution_ids":["https://openalex.org/I8078737"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.5096,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.66255731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"78","issue":"1-3","first_page":"227","last_page":"233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.996399998664856,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematics","display_name":"Mathematics","score":0.8122794032096863},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7661082744598389},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.764385461807251},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6029132604598999},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.5980716943740845},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5146511793136597},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.48562589287757874},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.47546666860580444},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.46988654136657715},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4508799612522125},{"id":"https://openalex.org/keywords/frequency-partition-of-a-graph","display_name":"Frequency partition of a graph","score":0.44934284687042236},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.44132426381111145},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.43869549036026},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4242759346961975},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4219376742839813},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.27198678255081177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11778885126113892},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07059073448181152},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06561961770057678}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8122794032096863},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7661082744598389},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.764385461807251},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6029132604598999},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5980716943740845},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5146511793136597},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.48562589287757874},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.47546666860580444},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.46988654136657715},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4508799612522125},{"id":"https://openalex.org/C178744013","wikidata":"https://www.wikidata.org/wiki/Q5502876","display_name":"Frequency partition of a graph","level":5,"score":0.44934284687042236},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.44132426381111145},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.43869549036026},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4242759346961975},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4219376742839813},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.27198678255081177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11778885126113892},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07059073448181152},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06561961770057678},{"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.1016/s0166-218x(97)00012-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(97)00012-7","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W96889678","https://openalex.org/W1963840573","https://openalex.org/W1981160730","https://openalex.org/W1993924797","https://openalex.org/W2054496228","https://openalex.org/W2055991650","https://openalex.org/W2058322021","https://openalex.org/W2085421834","https://openalex.org/W2096399406","https://openalex.org/W2143474538","https://openalex.org/W2471477565","https://openalex.org/W4299866835","https://openalex.org/W6603881796","https://openalex.org/W6903150785"],"related_works":["https://openalex.org/W2133099431","https://openalex.org/W2237480599","https://openalex.org/W2006429817","https://openalex.org/W2584414624","https://openalex.org/W1504745067","https://openalex.org/W3032870653","https://openalex.org/W1982865350","https://openalex.org/W4287775348","https://openalex.org/W2095499388","https://openalex.org/W2068710139"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}