Sampling to provide or to bound: With applications to fully dynamic graph algorithms
Research output: Contribution to journal › Journal article › Research
Standard
Sampling to provide or to bound: With applications to fully dynamic graph algorithms. / Henzinger, Monika Rauch; Thorup, Mikkel.
In: Random Structures and Algorithms, No. Vol.11, No.4, 1998, p. 369-379.Research output: Contribution to journal › Journal article › Research
Harvard
Henzinger, MR & Thorup, M 1998, 'Sampling to provide or to bound: With applications to fully dynamic graph algorithms', Random Structures and Algorithms, no. Vol.11, No.4, pp. 369-379.
APA
Henzinger, M. R., & Thorup, M. (1998). Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms, (Vol.11, No.4), 369-379.
Vancouver
Henzinger MR, Thorup M. Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms. 1998;(Vol.11, No.4):369-379.
Author
Bibtex
@article{406d6ad074ca11dbbee902004c4f4f50,
title = "Sampling to provide or to bound: With applications to fully dynamic graph algorithms",
author = "Henzinger, {Monika Rauch} and Mikkel Thorup",
year = "1998",
language = "English",
pages = "369--379",
journal = "Random Structures and Algorithms",
publisher = "Springer",
number = "Vol.11, No.4",
}
RIS
TY - JOUR
T1 - Sampling to provide or to bound: With applications to fully dynamic graph algorithms
AU - Henzinger, Monika Rauch
AU - Thorup, Mikkel
PY - 1998
Y1 - 1998
M3 - Journal article
SP - 369
EP - 379
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
IS - Vol.11, No.4
ER -
ID: 213945