Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Libro
|
![]() |
WALCOM: Algorithms and ComputationRahman Etsuji TomitaSpringer International Publishing 2015Acceso en línea |
2 |
Material Type: Libro
|
![]() |
Algorithmic learning theory 16th international conference, ALT 2005, Singapore, October 8-11, 2005 proceedingsALT 2005 (2005 Singapore) Sanjay Jain 1965 Feb. 22; Hans Ulrich Simon 1954; Etsuji TomitaBerlin Springer New York c2005Disponible en ICMC - Inst. Ciên. Mat. Computação (68-02 LNAI v.3734 ) y otras localizaciones(Obténgalo) |
3 |
Material Type: Libro
|
![]() |
Grammatical inference algorithms and applications : 8th international colloquium, ICGI 2006 Tokyo Japan, September 20-22, 2006 : proceedingsInternational Colloquium on Grammatical Inference (8th 2006 Tokyo, Japan) Yasubumi Sakakibara; Satoshi Kobayashi; Kengo Sato; Tetsuro Nishino; Etsuji TomitaBerlin Springer New York c2006Disponible en ICMC - Inst. Ciên. Mat. Computação (68-02 LNAI v.4201 ) y otras localizaciones(Obténgalo) |
4 |
Material Type: Artículo
|
![]() |
The worst-case time complexity for generating all maximal cliques and computational experimentsTomita, Etsuji ; Tanaka, Akira ; Takahashi, HaruhisaTheoretical computer science, 2006-10, Vol.363 (1), p.28-42 [Revista revisada por pares]Elsevier B.VTexto completo disponible |
5 |
Material Type: Acta de Congreso
|
![]() |
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum CliqueTomita, Etsuji ; Sutani, Yoichi ; Higashi, Takanori ; Takahashi, Shinya ; Wakatsuki, Mitsuo Fujita, Satoshi ; Rahman, Md. SaidurWALCOM: Algorithms and Computation, p.191-203 [Revista revisada por pares]Berlin, Heidelberg: Springer Berlin HeidelbergSin texto completo |
6 |
Material Type: Capítulo de Libro
|
![]() |
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch AlgorithmsConte, Alessio ; Tomita, Etsuji Nandy, Subhas C. ; Uehara, Ryuhei ; Hong, Seok-HeeWALCOM: Algorithms and Computation, p.195-207 [Revista revisada por pares]Cham: Springer International PublishingSin texto completo |
7 |
Material Type: Artículo
|
![]() |
Speeding-Up Construction Algorithms for the Graph Coloring ProblemKANAHARA, Kazuho ; KATAYAMA, Kengo ; TOMITA, EtsujiIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2022/09/01, Vol.E105.A(9), pp.1241-1251 [Revista revisada por pares]Tokyo: The Institute of Electronics, Information and Communication EngineersTexto completo disponible |
8 |
Material Type: Acta de Congreso
|
![]() |
A Fast and Complete Enumeration of Pseudo-Cliques for Large GraphsZhai, Hongjie ; Haraguchi, Makoto ; Okubo, Yoshiaki ; Tomita, Etsuji Khan, Latifur ; Washio, Takashi ; Dobbie, Gill ; Huang, Joshua Zhexue ; Bailey, James ; Wang, RuiliAdvances in Knowledge Discovery and Data Mining, p.423-435 [Revista revisada por pares]Cham: Springer International PublishingTexto completo disponible |
9 |
Material Type: Acta de Congreso
|
![]() |
An Efficient Branch-and-Bound Algorithm for Finding a Maximum CliqueTomita, Etsuji ; Seki, Tomokazu Dinneen, Michael J. ; Calude, Cristian S. ; Vajnovszki, VincentDiscrete Mathematics and Theoretical Computer Science, 2003, p.278-289 [Revista revisada por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponible |
10 |
Material Type: Artículo
|
![]() |
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithmsConte, Alessio ; Tomita, EtsujiTheoretical computer science, 2022-01, Vol.899, p.1-24 [Revista revisada por pares]Elsevier B.VTexto completo disponible |