IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v9y2005i2d10.1007_s10878-005-6853-7.html
   My bibliography  Save this article

Finding a Length-Constrained Maximum-Density Path in a Tree

Author

Listed:
  • Rung-Ren Lin

    (National Taiwan University)

  • Wen-Hsiung Kuo

    (National Taiwan University)

  • Kun-Mao Chao

    (National Taiwan University)

Abstract

Let T = (V,E,w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2,..., e k , is defined as ∑ k i = 1 w(e i )/k. The length of a path is the number of its edges. Given a tree with n edges and a lower bound L where 1≤ L ≤ n, this paper presents two efficient algorithms for finding a maximum-density path of length at least L in O(nL) time. One of them is further modified to solve some special cases such as full m-ary trees in O(n) time.

Suggested Citation

  • Rung-Ren Lin & Wen-Hsiung Kuo & Kun-Mao Chao, 2005. "Finding a Length-Constrained Maximum-Density Path in a Tree," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 147-156, March.
    • Handle: RePEc:spr:jcomop:v:9:y:2005:i:2:d:10.1007_s10878-005-6853-7
    DOI: 10.1007/s10878-005-6853-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-6853-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-005-6853-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:9:y:2005:i:2:d:10.1007_s10878-005-6853-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.