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

Hsiao-Fei Liu; Kun-Mao Chao

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

Computer Science and Game Theory 2008-08-23 v2 Data Structures and Algorithms

Authors: Hsiao-Fei Liu , Kun-Mao Chao

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.

Keywords

graph algorithm

Cite

@article{arxiv.0804.3860,
  title  = {An $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering},
  author = {Hsiao-Fei Liu and Kun-Mao Chao},
  journal= {arXiv preprint arXiv:0804.3860},
  year   = {2008}
}

Comments

Better results have been proposed in the following paper: Haeupler, Kavitha, Mathew, Sen, Tarjan: Faster Algorithms for Incremental Topological Ordering. ICALP (1) 2008: 421-433

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

Abstract

Keywords

Cite

Comments

Related papers