Average-case analysis of incremental topological ordering
From MaRDI portal
Publication:968137
DOI10.1016/J.DAM.2009.07.006zbMATH Open1226.05236OpenAlexW2035905579MaRDI QIDQ968137FDOQ968137
Deepak Ajwani, Tobias Friedrich
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10197/10132
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paths in graphs
- A dynamic topological sort algorithm for directed acyclic graphs
- Algorithms – ESA 2004
- Degree sequences of random graphs
- On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- An O ( n 2.75 ) algorithm for incremental topological ordering
- Online topological ordering
- On the computational complexity of dynamic graph problems
- Incremental algorithms for minimal length paths
- A phase transition phenomenon in a random directed acyclic graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online topological ordering
- Faster Algorithms for Incremental Topological Ordering
- Title not available (Why is that?)
- Maintaining a topological order under edge insertions
- A uniform approach to semi-dynamic problems on digraphs
- Average-Case Analysis of Online Topological Ordering
- An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
Cited In (2)
Uses Software
This page was built for publication: Average-case analysis of incremental topological ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968137)
