( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Enumerating Maximal Clique Sets with Pseudo-Clique Constraint.

, , , и . Discovery Science, том 9356 из Lecture Notes in Computer Science, стр. 324-339. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Takemasa Tomita

Naoko Tomita

Yuto Tomita

 

Другие публикации лиц с тем же именем

Guest Editors' Foreword., и . J. Graph Algorithms Appl., 20 (1): 1-2 (2016)Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms., , , , и . J. Bioinform. Comput. Biol., 4 (1): 19-42 (2006)Speeding-Up of Construction Algorithms for the Graph Coloring Problem., , , и . BWCCA, том 159 из Lecture Notes in Networks and Systems, стр. 211-222. Springer, (2020)The Worst-Case Time Complexity for Generating All Maximal Cliques., , и . COCOON, том 3106 из Lecture Notes in Computer Science, стр. 161-170. Springer, (2004)A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Accept Mode, , и . TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, (1998)A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique., , , , , и . FAW, том 9711 из Lecture Notes in Computer Science, стр. 215-226. Springer, (2016)A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata, , и . TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, (1995)Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound., , и . MLDM, том 9729 из Lecture Notes in Computer Science, стр. 569-583. Springer, (2016)Learning Boolean Functions in AC0 on Attribute and Classification Noise., , и . ALT, том 3244 из Lecture Notes in Computer Science, стр. 142-155. Springer, (2004)Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data., , и . ICGI, том 3264 из Lecture Notes in Computer Science, стр. 260-272. Springer, (2004)