Faster deterministic fully-dynamic graph connectivity
Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review
Standard
Faster deterministic fully-dynamic graph connectivity. / Wulff-Nilsen, Christian.
Encyclopedia of algorithms. ed. / Ming-Yang Kao. Springer, 2016. p. 738-741.Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review
Harvard
Wulff-Nilsen, C 2016, Faster deterministic fully-dynamic graph connectivity. in M-Y Kao (ed.), Encyclopedia of algorithms. Springer, pp. 738-741. https://doi.org/10.1007/978-1-4939-2864-4_569
APA
Wulff-Nilsen, C. (2016). Faster deterministic fully-dynamic graph connectivity. In M-Y. Kao (Ed.), Encyclopedia of algorithms (pp. 738-741). Springer. https://doi.org/10.1007/978-1-4939-2864-4_569
Vancouver
Wulff-Nilsen C. Faster deterministic fully-dynamic graph connectivity. In Kao M-Y, editor, Encyclopedia of algorithms. Springer. 2016. p. 738-741 https://doi.org/10.1007/978-1-4939-2864-4_569
Author
Bibtex
@inbook{47102844af7d442997704d6503e29d6b,
title = "Faster deterministic fully-dynamic graph connectivity",
author = "Christian Wulff-Nilsen",
year = "2016",
doi = "10.1007/978-1-4939-2864-4_569",
language = "English",
isbn = "978-1-4939-2863-7",
pages = "738--741",
editor = "Ming-Yang Kao",
booktitle = "Encyclopedia of algorithms",
publisher = "Springer",
address = "Switzerland",
}
RIS
TY - ENCYC
T1 - Faster deterministic fully-dynamic graph connectivity
AU - Wulff-Nilsen, Christian
PY - 2016
Y1 - 2016
U2 - 10.1007/978-1-4939-2864-4_569
DO - 10.1007/978-1-4939-2864-4_569
M3 - Encyclopedia chapter
SN - 978-1-4939-2863-7
SP - 738
EP - 741
BT - Encyclopedia of algorithms
A2 - Kao, Ming-Yang
PB - Springer
ER -
ID: 168284884