An <i>O</i> ( <i>n</i> <sup>2.75</sup> ) algorithm for incremental topological ordering (Q4962744)

From MaRDI portal
Revision as of 20:38, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6972914
Language Label Description Also known as
English
An <i>O</i> ( <i>n</i> <sup>2.75</sup> ) algorithm for incremental topological ordering
scientific article; zbMATH DE number 6972914

    Statements

    An <i>O</i> ( <i>n</i> <sup>2.75</sup> ) algorithm for incremental topological ordering (English)
    0 references
    0 references
    0 references
    0 references
    5 November 2018
    0 references
    dynamic algorithms
    0 references
    online algorithms
    0 references
    topological order
    0 references

    Identifiers

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