Yusuke Kobayashi (小林 佑輔), An FPT Algorithm for Minimum Additive Spanner Problem
For a positive integer t and a graph G, an additive t-spanner of G is a spanning subgraph in which the distance between every pair of vertices is at most …
1 event found.