Compressed $$\text {k}\mathsf {^d}\text {-tree}$$ k d -tree for temporal graphs
Crossref DOI link: https://doi.org/10.1007/s10115-015-0908-6
Published Online: 2015-12-31
Published Print: 2016-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Caro, Diego
Rodríguez, M. Andrea
Brisaboa, Nieves R.
Fariña, Antonio
Text and Data Mining valid from 2015-12-31