3.4k citations · 3.9k across the 67 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013★ 4 cited
Linear-Time FPT Algorithms via Network Flow
Yoichi Iwata, Keigo Oka, Yuichi Yoshida
In the area of parameterized complexity, to cope with NP-Hard problems, we introduce a parameter k besides the input size n, and we aim to design algorithms (called FPT algorithms)…
cs.DS2013★ 32 cited
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
We propose a new exact method for shortest-path distance queries on large-scale networks. Our method precomputes distance labels for vertices by performing a breadth-first search f…