Affordable Access

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

Authors
Type
Preprint
Publication Date
Submission Date
Source
arXiv
External links

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments
F