{"id":"https://openalex.org/W1981160730","doi":"https://doi.org/10.1016/0020-0190(94)00158-8","title":"The path-partition problem in block graphs","display_name":"The path-partition problem in block graphs","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W1981160730","doi":"https://doi.org/10.1016/0020-0190(94)00158-8","mag":"1981160730"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)00158-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00158-8","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/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":"last","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":true,"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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002508116"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":0.4332,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.58371146,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"52","issue":"6","first_page":"317","last_page":"322"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9977999925613403,"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/partition","display_name":"Partition (number theory)","score":0.7151612043380737},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.5969637632369995},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5622499585151672},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5155865550041199},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5079882740974426},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4910116195678711},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47947630286216736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4563491940498352},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4385724365711212},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.409138947725296},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3889772295951843},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3472519516944885},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3377061188220978}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7151612043380737},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5969637632369995},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5622499585151672},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5155865550041199},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5079882740974426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4910116195678711},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47947630286216736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4563491940498352},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4385724365711212},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.409138947725296},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3889772295951843},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3472519516944885},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3377061188220978},{"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/0020-0190(94)00158-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00158-8","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1963840573","https://openalex.org/W2001405099","https://openalex.org/W2054496228","https://openalex.org/W2055991650","https://openalex.org/W2096399406","https://openalex.org/W2143474538"],"related_works":["https://openalex.org/W2016277208","https://openalex.org/W1549987457","https://openalex.org/W2025912669","https://openalex.org/W2014615094","https://openalex.org/W1977789739","https://openalex.org/W2047470742","https://openalex.org/W4283803822","https://openalex.org/W2351778335","https://openalex.org/W4240458717","https://openalex.org/W2497180562"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}