Top tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Top tree" in English language version.

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

69^th place

59^th place

arxiv.org

Bille, Philip; Gørtz, Inge Li; Landau, Gad M.; Weimann, Oren (2015). "Tree Compression with Top Trees". Inf. Comput. 243: 166–177. arXiv:1304.5702. doi:10.1016/j.ic.2014.12.012.

Holm, J.; De Lichtenberg, K.; Thorup, M. (2001). "Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity". Journal of the ACM. 48 (4): 723. doi:10.1145/502090.502095. S2CID 7273552.
Holm, Jacob; Rotenberg, Eva; Thorup, Mikkel (2018), "Dynamic Bridge-Finding in ${\tilde {O}}(\log ^{2}n)$ Amortized Time", Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, doi:10.1137/1.9781611975031.3, S2CID 33964042
Holm, J.; De Lichtenberg, K.; Thorup, M. (2001). "Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity". Journal of the ACM. 48 (4): 723. doi:10.1145/502090.502095. S2CID 7273552.
Bille, Philip; Gørtz, Inge Li; Landau, Gad M.; Weimann, Oren (2015). "Tree Compression with Top Trees". Inf. Comput. 243: 166–177. arXiv:1304.5702. doi:10.1016/j.ic.2014.12.012.

Holm, J.; De Lichtenberg, K.; Thorup, M. (2001). "Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity". Journal of the ACM. 48 (4): 723. doi:10.1145/502090.502095. S2CID 7273552.
Holm, Jacob; Rotenberg, Eva; Thorup, Mikkel (2018), "Dynamic Bridge-Finding in ${\tilde {O}}(\log ^{2}n)$ Amortized Time", Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, doi:10.1137/1.9781611975031.3, S2CID 33964042
Holm, J.; De Lichtenberg, K.; Thorup, M. (2001). "Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity". Journal of the ACM. 48 (4): 723. doi:10.1145/502090.502095. S2CID 7273552.