MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Fully Dynamic Connectivity." – sorted by Relevance.

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

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

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

ATOM

Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
by Michael L. Fredman, Monika Rauch Henzinger — Algorithmica
…Lower Bounds for Fully Dynamic Connectivity Problems in Graphs Michael L. Fredman Monika Rauch…
Cited by 25 (5 self) – Add To MetaCart

An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms
by unknown authors
… An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms Raj D. Iyer Jr…
Add To MetaCart

An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms
by Raj Iyer Jr, David Karger, Hariharan S. Rahul, Mikkel Thorup — 2000 — Proc. of the 2nd International Workshop on Algorithm Engineering and Experiments (ALENEX'00
…An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms Raj D. Iyer Jr…
Add To MetaCart

An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms
by Raj D. Iyer, Jr., David Karger, Hariharan S. Rahul, Mikkel Thorup, Name David, R. Karger, Name Hariharan, S. Rahul — 2000
…An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms Raj D. Iyer Jr…
Cited by 6 (0 self) – Add To MetaCart

Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time
by Sotiris Nikoletseas, John Reif, Paul Spirakis, Moti Yung — 1995 — In Proceedings of the 22 nd ICALP
… Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time…
Cited by 4 (2 self) – Add To MetaCart

Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time
by Nikoletseas Reif Spirakis, S. Nikoletseas, J. Reif, P. Spirakis, M. Yung — 1995
…Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time S…
Add To MetaCart

Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning
by Kristian de Lichtenberg, Jacob Holm, Jacob Holm, Kristian De Lichtenberg, Mikkel Thorup, Mikkel Thorup — 1997 — Journal of the ACM
…-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree Jacob Holm Kristian…
Cited by 90 (4 self) – Add To MetaCart

Sampling to Provide or to Bound: With Applications to Fully Dynamic Graph Algorithms
by Monika Henzinger, Mikkel Thorup — 1997
…). For example, it improves the time per update for fully dynamic connectivity from O(log 3 n) to O(log 2 n…
Cited by 2 (0 self) – Add To MetaCart

To Provide or To Bound: Sampling in Fully Dynamic Graph Algorithms
by Monika R. Henzinger and Mikkel Thorup, Monika R. Henzinger, Monika R. Henzinger, Mikkel Thorup, Mikkel Thorup — 1991
…). For example, it improves the time per update for fully dynamic connectivity from O(log 3 n) to O(log 2 n…
Add To MetaCart

Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation
by Monika Rauch Henzinger, Valerie King — 1999 — JOURNAL OF THE ACM
… algorithms: We present the first fully dynamic algorithms that maintain connectivity, bipartiteness…
Cited by 28 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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