An $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering

Details An $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering An $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering

2008-04-24

arxiv.org/abs/0804.3860v2

Computer Science

Computer Science and Game Theory

Better results have been proposed in the following paper: Haeupler, Kavitha, Mathew, Sen, Tarjan: Faster Algorithms for Increm

Scientific paper

We present an $\tilde{O}(n^{2.5})$-time algorithm for maintaining the
topological order of a directed acyclic graph with $n$ vertices while inserting
$m$ edges.

Affiliated with

Also associated with

No associations

Rating

An $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-505106