Computer Science – Data Structures and Algorithms
Scientific paper
2007-11-02
Computer Science
Data Structures and Algorithms
Scientific paper
We present two algorithms for maintaining the topological order of a directed acyclic graph with n vertices, under an online edge insertion sequence of m edges. Efficient algorithms for online topological ordering have many applications, including online cycle detection, which is to discover the first edge that introduces a cycle under an arbitrary sequence of edge insertions in a directed graph. In this paper we present efficient algorithms for the online topological ordering problem. We first present a simple algorithm with running time O(n^{5/2}) for the online topological ordering problem. This is the current fastest algorithm for this problem on dense graphs, i.e., when m > n^{5/3}. We then present an algorithm with running time O((m + nlog n)\sqrt{m}); this is more efficient for sparse graphs. Our results yield an improved upper bound of O(min(n^{5/2}, (m + nlog n)sqrt{m})) for the online topological ordering problem.
Kavitha Telikepalli
Mathew Rogers
No associations
LandOfFree
Faster Algorithms 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 Faster Algorithms for Online Topological Ordering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster Algorithms for Online Topological Ordering will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-437151