Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for the k Maximal Sums Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependence of densities on a parameter / 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: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for selection in a min-heap / 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: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a longest nonnegative path in a constant degree tree / 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: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. / 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: Priority Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Adjusting Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for finding a length-constrained maximum-density subtree in a tree / 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 09:39, 9 July 2024

scientific article
Language Label Description Also known as
English
Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths
scientific article

    Statements

    Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (English)
    0 references
    0 references
    0 references
    0 references
    28 November 2014
    0 references
    counting mode
    0 references
    design and analysis of algorithms
    0 references
    feasible paths
    0 references
    \(k\)-maximum density path problem
    0 references
    network design
    0 references
    trees
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references