|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Mattia D?Emidio, Imran Khan and Daniele Frigioni
|
|
|
|
|
|
|
|
|
|
|
Mattia D?Emidio, Gabriele Di Stefano and Alfredo Navarra
The paper deals with the Bamboo Garden Trimming (BGT) problem introduced in [Gasieniec et al., SOFSEM?17]. The problem is difficult to solved due to its close relationship to Pinwheel scheduling. The garden with n bamboos is an analogue of a system of n ...
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
|
|
|
|
|
|