Takayuki Nagoya
Tottori University of Environmental Studies
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Takayuki Nagoya.
Discrete Applied Mathematics | 2005
Ryuhei Uehara; Seinosuke Toda; Takayuki Nagoya
This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees with unbounded k. On the other hand, the relative complexity of the GI problem for the above classes was unknown. We prove that deciding isomorphism of the classes are GI complete.
Journal of Combinatorial Optimization | 2007
Zhi-Zhong Chen; Takayuki Nagoya
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is
european symposium on algorithms | 2005
Zhi-Zhong Chen; Takayuki Nagoya
Journal of Multimedia | 2012
Takayuki Nagoya; Hiroyuki Fujioka
\frac{27}{35}
Theory of Computing Systems \/ Mathematical Systems Theory | 2009
Takayuki Nagoya
Information Processing Letters | 2009
Takayuki Nagoya
. The other is for undirected graphs and its approximation ratio is
international conference on frontiers in handwriting recognition | 2012
Takayuki Nagoya; Hiroyuki Fujioka
mathematical foundations of computer science | 2007
Takayuki Nagoya; Seinosuke Toda
\frac{7}{8}-o(1)
ieee international conference on smart city socialcom sustaincom | 2015
Takayuki Nagoya
福岡工業大学情報科学研究所所報 | 2013
Takayuki Nagoya; Hiroyuki Fujioka
. Both algorithms improve on the previous bests.
Collaboration
Dive into the Takayuki Nagoya's collaboration.
