Order Article Reprints

Algorithms2020, 13(9), 211;https://doi.org/10.3390/a13090211

Journal: AlgorithmsVolume: 13Number: 211

Article: Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs

Authors:
Pierluigi Crescenzi^1,†,
Clémence Magnien² and
Andrea Marino^3,*

Link: https://www.mdpi.com/1999-4893/13/9/211

MDPI offers high quality article reprints with convenient shipping to destinations worldwide. Each reprint features a 270 gsm bright white cover and 105 gsm premium white paper, bound with two stitches for durability and printed in full color. The cover design is customized to your article and designed to be complimentary to the journal.

Order Article Reprints

Order Cost and Details

Shipping Address

Billing Address