Average-Case Analysis of Online Topological Ordering (Q5387779): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_41 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1549024371 / 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: Incremental algorithms for minimal length paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to semi-dynamic problems on digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online topological ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921699 / 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: Q2712580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On competitive on-line algorithms for the dynamic priority-ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of dynamic graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic reachability algorithm for directed graphs with an almost linear update time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank

Latest revision as of 09:55, 28 June 2024

scientific article; zbMATH DE number 5279472
Language Label Description Also known as
English
Average-Case Analysis of Online Topological Ordering
scientific article; zbMATH DE number 5279472

    Statements

    Identifiers