MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Fully Dynamic Transitive Closure." – sorted by Relevance.

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

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

15 documents found, showing 1 through 10. Next 10 →

ATOM

Fully Dynamic Transitive Closure:
by Breaking Through The, Camil Demetrescu — 2000 — In Proc. IEEE Symposium on Foundations of Computer Science
…Fully Dynamic Transitive Closure: Breaking Through the O(n 2 ) Barrier Camil Demetrescu y…
Add To MetaCart

Maintaining dynamic matrices for fully dynamic transitive closure
by Camil Demetrescu — 2002
…arXiv:cs.DS/0104002 31 Mar 2001 Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure…
Cited by 1 (1 self) – Add To MetaCart

Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure
by Camil Demetrescu, Giuseppe F. Italiano — 2002
…Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure Camil Demetrescu y Dipartimento…
Add To MetaCart

Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink
by Thore Husfeldt — 1994
…Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink # Thore Husfeldt…
Cited by 3 (2 self) – Add To MetaCart

Fully Dynamic Transitive Closure: Breaking Through the O(n^2) Barrier
by Camil Demetrescu, Giuseppe F. Italiano — 2000 — In Proc. IEEE Symposium on Foundations of Computer Science
…Fully Dynamic Transitive Closure: Breaking Through the O(n 2 ) Barrier Camil Demetrescu y…
Cited by 31 (7 self) – Add To MetaCart

Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2) barrier
by Camil Demetrescu — 2005 — J. ACM
…Trade-offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n 2 ) Barrier…
Cited by 2 (0 self) – Add To MetaCart

A Fully Dynamic Algorithm for Maintaining the Transitive Closure
by Valerie King, Garry Sagert — 1999 — In Proc. 31st ACM Symposium on Theory of Computing (STOC'99
…A Fully Dynamic Algorithm for Maintaining the Transitive Closure Valerie King Garry Sagert y…
Cited by 26 (1 self) – Add To MetaCart

Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure
by Valerie King, Vw P — 1999 — In Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS’99
…Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure…
Cited by 40 (0 self) – Add To MetaCart

Fully Dynamic Algorithms for Path Problems on Directed Graphs
by Prof Umberto Nanni (advisor, Prof Giorgio Ausiello, Prof Rossella Petreschi, Prof Valerie King, Prof Christos Zaroliagis, Camil Demetrescu, Camil Demetrescu, Camil Demetrescu
… of the most fundamental path problems: fully dynamic transitive closure and fully dynamic single…
Add To MetaCart

Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
by Camil Demetrescu — 2006 — J. Discr. Algor
… fundamental problems. In the fully dynamic transitive closure problem we wish to maintain a directed graph G…
Cited by 2 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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