5 citations · 13 across the 10 of their papers we have counts for
3 papers · 1 filter
Reconfiguration of Time-Respecting Arborescences
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama +4
An arborescence, which is a directed analogue of a spanning tree in an undirected graph, is one of the most fundamental combinatorial objects in a digraph. In this paper, we study…
Algorithmic Theory of Qubit Routing
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +2
The qubit routing problem, also known as the swap minimization problem, is a (classical) combinatorial optimization problem that arises in the design of compilers of quantum progra…
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +4
We prove that the computation of a combinatorial shortest path between two vertices of a graph associahedron, introduced by Carr and Devadoss, is NP-hard. This resolves an open pro…