%0 Journal Article %1 journals/algorithms/CrescenziMM20 %A Crescenzi, Pierluigi %A Magnien, Clémence %A Marino, Andrea %D 2020 %J Algorithms %K dblp %N 9 %P 211 %T Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. %U http://dblp.uni-trier.de/db/journals/algorithms/algorithms13.html#CrescenziMM20 %V 13

@article{journals/algorithms/CrescenziMM20, added-at = {2023-06-18T00:00:00.000+0200}, author = {Crescenzi, Pierluigi and Magnien, Clémence and Marino, Andrea}, biburl = {https://www.bibsonomy.org/bibtex/2d5f7284cf14d822992a85055c2d24383/dblp}, ee = {https://doi.org/10.3390/a13090211}, interhash = {956ee043c00d8ec3a6be098d8c001953}, intrahash = {d5f7284cf14d822992a85055c2d24383}, journal = {Algorithms}, keywords = {dblp}, number = 9, pages = 211, timestamp = {2024-04-09T05:18:50.000+0200}, title = {Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs.}, url = {http://dblp.uni-trier.de/db/journals/algorithms/algorithms13.html#CrescenziMM20}, volume = 13, year = 2020 }