A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering (Q2465638): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online topological ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining a topological order under edge insertions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic topological sort algorithm for directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On competitive on-line algorithms for the dynamic priority-ordering problem / rank
 
Normal rank

Revision as of 13:44, 27 June 2024

scientific article
Language Label Description Also known as
English
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
scientific article

    Statements

    A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering (English)
    0 references
    0 references
    0 references
    7 January 2008
    0 references
    algorithms
    0 references
    topological order
    0 references
    online algorithms
    0 references
    tight analysis
    0 references
    0 references
    0 references

    Identifiers