Yuichi Yoshida

most citedFast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling

32 citations · 33 across the 3 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

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…

cs.DS2011

Testing List H-Homomorphisms

Yuichi Yoshida

Let $H$ be an undirected graph. In the List $H$ -Homomorphism Problem, given an undirected graph $G$ with a list constraint $L (v) \subseteq V (H)$ for each variable $v \in V (G)$ , the…

cs.DS2011★ 1 cited

Constant-Time Algorithms for Sparsity Matroids

Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida

A graph $G = (V, E)$ is called $(k, ℓ)$ -full if $G$ contains a subgraph $H = (V, F)$ of $k ∣ V ∣ - ℓ$ edges such that, for any non-empty $F^{'} \subseteq F$ , $∣ F^{'} ∣ \leq k ∣ V (F^{'}) ∣ - ℓ$ hol…