The set union problem with dynamic weighted backtracking (Q804287): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(EV\log^2V)\) algorithm for the maximal flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of the set-union problem with extended backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-m search in branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on the Complexity of the Union-Split-Find Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of algorithms which require nonlinear time to maintain disjoint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case Analysis of Set Union Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Analysis of Algorithms for Set Union with Backtracking / rank
 
Normal rank

Revision as of 16:11, 21 June 2024

scientific article
Language Label Description Also known as
English
The set union problem with dynamic weighted backtracking
scientific article

    Statements

    Identifiers

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