( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Computing the Diameter of Real-World Directed (Weighted) Graphs.

, , , и . SEA, том 7276 из Lecture Notes in Computer Science, стр. 99-110. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Marino Philippi

Daniela Marino

Enzo Marino

Marino Perini

Marino Philippi

 

Другие публикации лиц с тем же именем

An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs., , , и . SDM, стр. 289-297. SIAM, (2023)Smooth movement and Manhattan path based Random Waypoint mobility., , , , , и . Inf. Process. Lett., 111 (5): 239-246 (2011)Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs., , и . Algorithms, 13 (9): 211 (2020)A Fast Algorithm for Large Common Connected Induced Subgraphs., , , , и . AlCoB, том 10252 из Lecture Notes in Computer Science, стр. 62-74. Springer, (2017)BUbiNG: massive crawling for the masses., , , и . WWW (Companion Volume), стр. 227-228. ACM, (2014)On the Energy Consumption and Performance of WebAssembly Binaries across Programming Languages and Runtimes in IoT., , , , , и . EASE, стр. 72-82. ACM, (2023)Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs., , , и . IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 148-159. Springer, (2019)Enumerating Cyclic Orientations of a Graph., , , и . IWOCA, том 9538 из Lecture Notes in Computer Science, стр. 88-99. Springer, (2015)A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs., , , и . TAPAS, том 6595 из Lecture Notes in Computer Science, стр. 92-103. Springer, (2011)On Computing the Diameter of Real-World Directed (Weighted) Graphs., , , и . SEA, том 7276 из Lecture Notes in Computer Science, стр. 99-110. Springer, (2012)