An optimal algorithm for the maximum-density path in a tree (Q989545): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.05.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059509874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of 2-medians in a tree network with positive/negative weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Maximum-Density Segment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum-density path in a tree under the weight and length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a length-constrained maximum-density path in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the length-constrained heaviest path problem on a tree / rank
 
Normal rank

Latest revision as of 02:21, 3 July 2024

scientific article
Language Label Description Also known as
English
An optimal algorithm for the maximum-density path in a tree
scientific article

    Statements

    An optimal algorithm for the maximum-density path in a tree (English)
    0 references
    0 references
    20 August 2010
    0 references
    algorithms
    0 references
    tree
    0 references
    optimization problem
    0 references
    spine decomposition
    0 references

    Identifiers