2 papers
cs.DC2021
Lower Bounds for Induced Cycle Detection in Distributed Computing
François Le Gall, Masayuki Miyamoto
The distributed subgraph detection asks, for a fixed graph , whether the -node input graph contains as a subgraph or not. In the standard CONGEST model of distributed com…
quant-ph2019
Quantum Speedup for the Minimum Steiner Tree Problem
Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise +1
A recent breakthrough by Ambainis, Balodis, Iraids, Kokainis, Prūsis and Vihrovs (SODA'19) showed how to construct faster quantum algorithms for the Traveling Salesman Problem and…