2 papers
cs.DS2023
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi +2
In this paper, we present the first study of the computational complexity of converting an automata-based text index structure, called the Compact Directed Acyclic Word Graph (CDAW…
cs.DS2023
Minimum Consistent Subset for Trees Revisited
Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi +2
In a vertex-colored graph , a subset is said to be consistent if every vertex has a nearest neighbor in with the same color. The problem of computin…