Searching for "An O(n2.75) Algorithm for Online Topological Ordering." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

An O(n 2.75 ) algorithm for online topological ordering
by Deepak Ajwani, Tobias Friedrich, Ulrich Meyer — 2006 — In Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, LNCS 4059
…An O(n 2.75 ) algorithm for online topological ordering ⋆ Deepak Ajwani, Tobias Friedrich…
Cited by 4 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB