#### Filter Results:

- Full text PDF available (22)

#### Publication Year

1982

2017

- This year (1)
- Last 5 years (17)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
- Theor. Comput. Sci.
- 2004

We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron–Kerbosch algorithm. All the maximal cliques generated are output in a tree-like form. Subsequently, we prove that its worst-case time complexity is O(3n/3) for an n-vertex graph. This is optimal as a… (More)

- Etsuji Tomita, Tomokazu Seki
- DMTCS
- 2003

- Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki
- IEICE Transactions
- 2010

Many problems can be formulated as maximum clique problems. Hence, it is highly important to develop algorithms that can find a maximum clique very fast in practice. We propose new approximate coloring and other related techniques which markedly improve the run time of the branch-and-bound algorithm MCR (J. Global Optim., 37, pp.95–111, 2007), previously… (More)

- Etsuji Tomita, Toshikatsu Kameda
- J. Global Optimization
- 2007

- Miklo Shindo, Etsuji Tomita
- Systems and Computers in Japan
- 1990

- Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu
- Journal of Computational Biology
- 2012

Many kinds of tree-structured data, such as RNA secondary structures, have become available due to the progress of techniques in the field of molecular biology. To analyze the tree-structured data, various measures for computing the similarity between them have been developed and applied. Among them, tree edit distance is one of the most widely used… (More)

- Haruhisa Takahashi, Etsuji Tomita, Tsutomu Kawabata
- Neural Networks
- 1993

- Tatsuya Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita
- 2011 International Conference on Complex…
- 2011

The tree edit distance is one of the most widely used measures for comparison of tree structured data and has been used for analysis of RNA secondary structures, glycan structures, and vascular trees. However, it is known that the tree edit distance problem is NP-hard for unordered trees while it is polynomial time solvable for ordered trees. We have… (More)

- Yoshiaki Yamada, Etsuji Tomita, Haruhisa Takahashi
- Systems and Computers in Japan
- 1994