|
|
|
|
|
Mattia D?Emidio
Computing shortest-path distances is a fundamental primitive in the context of graph data mining, since this kind of information is essential in a broad range of prominent applications, which include social network analysis, data routing, web search opti...
ver más
|
|
|
|
|
|
|
|
|
|
|
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari and Charilaos Tzovas
The field of network science is a highly interdisciplinary area; for the empirical analysis of network data, it draws algorithmic methodologies from several research fields. Hence, research procedures and descriptions of the technical results often diffe...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mattia D?Emidio and Daniele Frigioni
The purpose of this special issue of Algorithms was to attract papers presenting original research in the area of algorithm engineering. In particular, submissions concerning the design, analysis, implementation, tuning, and experimental evaluation of di...
ver más
|
|
|
|
|
|