32 citations · 56 across the 11 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 3 cited
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover
Takuya Akiba, Yoichi Iwata
We investigate the gap between theory and practice for exact branching algorithms. In theory, branch-and-reduce algorithms currently have the best time complexity for numerous impo…
cs.DS2014★ 3 cited
Fast Dynamic Graph Algorithms for Parameterized Problems
Yoichi Iwata, Keigo Oka
Fully dynamic graph is a data structure that (1) supports edge insertions and deletions and (2) answers problem specific queries. The time complexity of (1) and (2) are referred to…