Searching for authors named "Monika Rauch Henzinger" – sorted by Relevance.
-
Approximating Minimum Cuts under Insertions (Extended Abstract)
- -1198 (510) 643-9153 FAX (510) 643-7684 Approximating Minimum Cuts under Insertions Monika Rauch Henzinger
- Add To MetaCart
-
Improved Data Structures for Fully Dynamic Biconnectivity
- Biconnectivity Monika Rauch Henzinger d i g i t a l Systems Research Center 130 Lytton Avenue Palo Alto
- Cited by 2 (0 self) – Add To MetaCart
-
Fully Dynamic Cycle-Equivalence in Graphs
- Fully Dynamic Cycle-Equivalence in Graphs to appear in Proceedings of FOCS 94 Monika Rauch
- Cited by 2 (1 self) – Add To MetaCart
-
A Static 2-Approximation Algorithm for Vertex Connectivity and Imcremental Approximation Algorithms for Edge and Vertex Connectivity
- for Edge and Vertex Connectivity Monika Rauch Henzinger ? Digital Systems Research Center,130 Lytton
- Cited by 6 (1 self) – Add To MetaCart
-
Scheduling Multicasts on Unit-Capacity Trees and Meshes
- Monika Rauch Henzinger and Stefano Leonardi d i g i t a l Systems Research Center 130 Lytton Avenue Palo
- Cited by 2 (0 self) – Add To MetaCart
-
Maintaining Minimum Spanning Trees in Dynamic Graphs
- Graphs Monika Rauch Henzinger and Valerie King d i g i t a l Systems Research Center 130 Lytton Avenue
- Cited by 21 (2 self) – Add To MetaCart
-
Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation
- in Polylogarithmic Time per Operation Monika Rauch Henzinger and Valerie King d i g i t a l Systems Research Center
- Cited by 6 (0 self) – Add To MetaCart
-
Improved Sampling with Applications to Dynamic Graph Algorithms.
- Improved Sampling with Applications to Dynamic Graph Algorithms. Monika Rauch Henzinger 1
- Cited by 9 (6 self) – Add To MetaCart
-
Faster Vertex Connectivity Algorithms
- Faster Vertex Connectivity Algorithms Monika Rauch Henzinger Satish Rao y Abstract We present
- Cited by 1 (0 self) – Add To MetaCart
-
Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation
- Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation Monika Rauch
- Cited by 28 (0 self) – Add To MetaCart

