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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2007.08.009 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: COMET / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sather / rank
 
Normal rank
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.tcs.2007.08.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068283945 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2007.08.009 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:36, 18 December 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