Finding a longest nonnegative path in a constant degree tree
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, SK | - |
dc.date.available | 2019-05-30T08:32:03Z | - |
dc.date.issued | 2005-03 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.issn | 1872-6119 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/24645 | - |
dc.description.abstract | A longest nonnegative path in an edge-weighted tree is a path such that the sum of edge weights on it is nonnegative and the number of edges on it is as large as possible. In this paper we show that if a tree has a constant degree, then its longest nonnegative path can be found in O(n log n) time, where n is the number of nodes. Previously known algorithms take O(n log(2) n) time. | - |
dc.format.extent | 5 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Finding a longest nonnegative path in a constant degree tree | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.ipl.2004.11.012 | - |
dc.identifier.bibliographicCitation | INFORMATION PROCESSING LETTERS, v.93, no.6, pp 275 - 279 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 000227172700003 | - |
dc.identifier.scopusid | 2-s2.0-13844275487 | - |
dc.citation.endPage | 279 | - |
dc.citation.number | 6 | - |
dc.citation.startPage | 275 | - |
dc.citation.title | INFORMATION PROCESSING LETTERS | - |
dc.citation.volume | 93 | - |
dc.type.docType | Article | - |
dc.publisher.location | 네델란드 | - |
dc.subject.keywordAuthor | algorithms | - |
dc.subject.keywordAuthor | nonnegative paths | - |
dc.subject.keywordAuthor | trees | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.