1
0
0
(1 - 19 von 19
)
SCEAS
sceas.csd.auth.gr
Monika Rauch Henzinger, Valerie King Fully Dynamic Biconnectivity and Transitive Closure. [Citation Graph (1, 0)][DBLP] FOCS, 1995, pp: [Conf]
CiteSeerX — Randomized Fully Dynamic Graph Algorithms with...
citeseerx.ist.psu.edu
author = {Monika Rauch Henzinger and Valerie King}, title = {Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation},
dblp: Monika Henzinger
dblp.uni-trier.de
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai: Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log 3 n) Worst Case Update Time. CoRR abs ( )
Search results for "connectivity" – FacetedDBLP
dblp.l3s.de
Monika Rauch Henzinger, Michael L. Fredman: Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica : 1998: DBLP DOI BibTeX RDF: Dynamic planarity testing, Dynamic connectivity testing, Dynamic planarity testing, Dynamic connectivity testing, Lower bounds, Lower bounds, Key words, Cell probe model, Cell probe model: 36
Improved data structures for fully dynamic biconnectivity - CORE
core.ac.uk
By Monika Rauch Henzinger. Abstract. We present fully dynamic algorithms for maintaining the biconnected components in general and plane graphs. A fully dynamic algorithm maintains a graph during a sequence of insertions and deletions of edges or isolated
Randomized Fully Dynamic Graph Algorithms with Polylogarithmic...
citeseer.ist.psu.edu
BibTeX @ARTICLE{Henzinger99randomizedfully, author = {Monika Rauch Henzinger and Valerie King}, title = {Randomized Fully Dynamic Graph Algorithms with
TAA - Theory and Applications of Algorithms
taa.cs.univie.ac.at
The papers "Shared-Memory Branch-and-Reduce for Multiterminal Cuts" by Monika Henzinger, Alexander Noe and Christan Schulz, "Fully Dynamic Single-Source Reachability
CiteSeerX — Randomized Fully Dynamic Graph Algorithms with...
citeseerx.ist.psu.edu
Other Repositories/Bibliography. DBLP. Save to List; Add to Collection · …ct Errors · Monitor Changes. by Monika Rauch Henzinger , Valerie King ...
CiteSeerX — Fully Dynamic 2-Edge Connectivity Algorithm in...
citeseerx.ist.psu.edu
author = {Monika Rauch Henzinger and Valerie King}, title = {Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation}, year = {1997}
CS 573: Topics in Analysis of Algorithms (Spring 2006)
jeffe.cs.illinois.edu
[HK99]: Monika Rauch Henzinger and Valerie King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46: , ...
1
www.nzdl.org
Randomized Fully Dynamic Graph Algorithms with. Polylogarithmic Time per Operation. Monika Rauch Henzinger ? Valerie King y. Abstract. This paper solves a ...
hdtgraph · PyPI
pypi.org
Monika Rauch Henzinger, Valerie King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46(4) July ...
Algorithmica
ftp.math.utah.edu
Monika Rauch Henzinger Fully Dynamic Biconnectivity in Graphs Achim Schweikard and R. H. Wilson Assembly Sequences for Polyhedra
DBLP: Mikkel Thorup
www.vldb.org
Monika Rauch Henzinger, Mikkel Thorup: Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Struct. Algorithms 11(4): (1997)
Alle Infos zum Namen "Monika Rauch Henzinger"
Verwandte Suchanfragen zu Monika Rauch Henzinger
| Ingmar Weber Valerie King Monika Henzinger | Thomas Schwentick Monika Egger-Rauch |
Personen Vorname Name "Henzinger" (18) |
sortiert nach Relevanz / Datum