{"id":"https://openalex.org/W2009843927","doi":"https://doi.org/10.1587/transinf.2014edp7009","title":"Algorithm for the Length-Constrained Maximum-Density Path Problem in a Tree with Uniform Edge Lengths","display_name":"Algorithm for the Length-Constrained Maximum-Density Path Problem in a Tree with Uniform Edge Lengths","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2009843927","doi":"https://doi.org/10.1587/transinf.2014edp7009","mag":"2009843927"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2014edp7009","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2014edp7009","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E98.D/1/E98.D_2014EDP7009/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/transinf/E98.D/1/E98.D_2014EDP7009/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102842836","display_name":"Sung Kwon Kim","orcid":"https://orcid.org/0000-0001-5938-4262"},"institutions":[{"id":"https://openalex.org/I67900169","display_name":"Chung-Ang University","ror":"https://ror.org/01r024a98","country_code":"KR","type":"education","lineage":["https://openalex.org/I67900169"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sung Kwon KIM","raw_affiliation_strings":["School of Computer Science and Engineering, Chung-Ang University","School of Computer Science and Engineering, Chung-ang University"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Chung-Ang University","institution_ids":["https://openalex.org/I67900169"]},{"raw_affiliation_string":"School of Computer Science and Engineering, Chung-ang University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102842836"],"corresponding_institution_ids":["https://openalex.org/I67900169"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08529969,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"E98.D","issue":"1","first_page":"103","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9923999905586243,"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/path","display_name":"Path (computing)","score":0.7765660285949707},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.734272837638855},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5964253544807434},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5888133645057678},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5840415954589844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5664970874786377},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.47262072563171387},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.45457595586776733},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4155419170856476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3453260064125061},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2882354259490967},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2259010672569275},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1099649965763092}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7765660285949707},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.734272837638855},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5964253544807434},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5888133645057678},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5840415954589844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5664970874786377},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47262072563171387},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45457595586776733},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4155419170856476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3453260064125061},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2882354259490967},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2259010672569275},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1099649965763092},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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.1587/transinf.2014edp7009","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2014edp7009","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E98.D/1/E98.D_2014EDP7009/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1587/transinf.2014edp7009","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2014edp7009","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E98.D/1/E98.D_2014EDP7009/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G626505518","display_name":null,"funder_award_id":"No. 201","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G7951966858","display_name":null,"funder_award_id":"120082","funder_id":"https://openalex.org/F4320320671","funder_display_name":"National Research Foundation"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320321202","display_name":"Chung-Ang University","ror":"https://ror.org/01r024a98"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320322349","display_name":"Ministry of Education, Science and Technology","ror":"https://ror.org/01p262204"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2009843927.pdf","grobid_xml":"https://content.openalex.org/works/W2009843927.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1963834353","https://openalex.org/W1967116716","https://openalex.org/W1982161423","https://openalex.org/W1999778926","https://openalex.org/W2011999472","https://openalex.org/W2040381019","https://openalex.org/W2046946959","https://openalex.org/W2070523096","https://openalex.org/W2090879820","https://openalex.org/W2093961518","https://openalex.org/W2105089535","https://openalex.org/W2115407612","https://openalex.org/W2121473031","https://openalex.org/W2146968241","https://openalex.org/W3099635146"],"related_works":["https://openalex.org/W2002764510","https://openalex.org/W2183747532","https://openalex.org/W2237480599","https://openalex.org/W2133099431","https://openalex.org/W2776102956","https://openalex.org/W2020255949","https://openalex.org/W2018146256","https://openalex.org/W1957820195","https://openalex.org/W2129550502","https://openalex.org/W4304192587"],"abstract_inverted_index":{"Given":[0],"an":[1,61],"edge-weighted":[2],"tree":[3],"with":[4,27],"n":[5],"vertices":[6],"and":[7],"a":[8,20,36],"positive":[9],"integer":[10],"L,":[11],"the":[12,31,39,42,45,48,52,57,66],"length-constrained":[13],"maximum-density":[14],"path":[15,21,37,49],"problem":[16],"is":[17,38],"to":[18],"find":[19],"of":[22,35,41,44,54],"length":[23],"at":[24],"least":[25],"L":[26],"maximum":[28],"density":[29,34],"in":[30,47,56,73],"tree.":[32],"The":[33,68],"sum":[40],"weights":[43],"edges":[46,55],"divided":[50],"by":[51],"number":[53],"path.":[58],"We":[59],"present":[60],"O(n)":[62],"time":[63],"algorithm":[64],"for":[65],"problem.":[67],"previously":[69],"known":[70],"algorithms":[71],"run":[72],"O(nL)":[74],"or":[75],"O(n":[76],"log":[77],"n)":[78],"time.":[79]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}