M
Mitsuo Wakatsuki
Researcher at University of Electro-Communications
Publications - 23
Citations - 360
Mitsuo Wakatsuki is an academic researcher from University of Electro-Communications. The author has contributed to research in topics: Deterministic pushdown automaton & Deterministic automaton. The author has an hindex of 9, co-authored 23 publications receiving 330 citations.
Papers
More filters
Book ChapterDOI
A simple and faster branch-and-bound algorithm for finding a maximum clique
TL;DR: This paper proposes new approximate coloring and other related techniques which markedly improve the run time of the branch-and-bound algorithm MCR, previously shown to be the fastest maximum-clique-finding algorithm for a large number of graphs.
Book ChapterDOI
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
TL;DR: In this article, a branch-and-bound maximum-clique-finding algorithm MCS (WALCOM 2010, LNCS 5942, pp. 191 and 203) was proposed.
Journal ArticleDOI
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments
TL;DR: This paper proposes new approximate coloring and other related techniques which markedly improve the run time of the branch-and-bound algorithm MCR, and demonstrates the effectiveness of each new techniques in MCS, as well as the overall contribution.
Proceedings ArticleDOI
A source code plagiarism detecting method using alignment with abstract syntax tree elements
TL;DR: This paper proposes a plagiarism detection method which is not influenced by changing the identifier or program statement order, and explains its capabilities by comparing it to the sim plagiarism detector.