1 citations · 1 across the 6 of their papers we have counts for
4 papers · 1 filter
On the complexity of finding a spanning even tree in a graph
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita +4
A tree is said to be even if for every pair of distinct leaves, the length of the unique path between them is even. In this paper we discuss the problem of determining whether an i…
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
Takuya Mieno, Shun Takahashi, Kazuhisa Seto +1
A string is said to be closed if its length is one, or if it has a non-empty factor that occurs both as a prefix and as a suffix of the string, but does not occur elsewhere. The no…
Shortest cover after edit
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto +1
This paper investigates the (quasi-)periodicity of a string when the string is edited. A string is called a cover (as known as a quasi-period) of a string if each character…
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono +2
The uniqueness of an optimal solution to a combinatorial optimization problem attracts many fields of researchers' attention because it has a wide range of applications, it is rela…