Average-case analysis of incremental topological ordering

DOI10.1016/j.dam.2009.07.006zbMath1226.05236OpenAlexW2035905579MaRDI QIDQ968137

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

zbMATH Keywords

random graphsaverage-case analysisdynamic graph algorithms

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Topological sorts on DAGs

Uses Software

• Sather

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree sequences of random graphs
• A uniform approach to semi-dynamic problems on digraphs
• On the computational complexity of dynamic graph problems
• Maintaining a topological order under edge insertions
• Online topological ordering
• On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
• A dynamic topological sort algorithm for directed acyclic graphs
• Faster Algorithms for Incremental Topological Ordering
• A fully dynamic reachability algorithm for directed graphs with an almost linear update time
• Incremental algorithms for minimal length paths
• Paths in graphs
• An O ( n ^2.75 ) algorithm for incremental topological ordering
• Average-Case Analysis of Online Topological Ordering
• Algorithms – ESA 2004
• An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering

This page was built for publication: Average-case analysis of incremental topological ordering