ETSUJI Tomita 富田悦次

… Alternative Names

TOMITA Etsuji 富田悦次

Less

Researcher Number	40016598
Other IDs
External Links
Affiliation (based on the past Project Information) *help	2012 – 2020: 電気通信大学, その他部局等, 名誉教授 2008 – 2014: The University of Electro-Communications, 名誉教授 2010: 電気通信大学, 電気通信大学, 名誉教授 2008 – 2010: 電気通信大学, 電気通信学部, 名誉教授 1997 – 2008: 電気通信大学, 電気通信学部, 教授 1990 – 1995: 電気通信大学, 電気通信学部, 教授 1986 – 1987: University of Electro-Communications, 電気通信学部, 教授
Review Section/Research Field	Principal Investigator Fundamental theory of informatics / 計算機科学 / 計算機工学 / Theory of informatics / Intelligent informatics / 情報工学 Except Principal Investigator Intelligent informatics / 情報通信工学 / 電子通信系統工学 / Fundamental theory of informatics / 計算機工学 / 計算機科学
Keywords	Principal Investigator 最大クリーク / 分枝限定法 / 極大クリーク / アルゴリズム / 時間計算量 / NP完全問題 / 多項式時間的可解性 / 近似彩色 / 近似アルゴリズム / 深さ優先探索 … More / 計算機実験 / データマイニング / 分枝限定アルゴリズム / オートマトン / Maximum clique / Dominating Set / RNA secondary structure prediction / approximate coloring / maximum clique / 最大重みクリーク / 組合せ最適化 / Boltzmann machine / グラフ / 列挙 / 近似解法 / バイオインフォマティクス / 計算論的学習理論 / 実働化評価 / 時間計算量解析 / 実働評価 / 厳密解法 / 最大独立節点集合 / 多項式時間 / 遅延 / 分枝限定 / 符号理論 / Pushdown Automata / 等価性判定 / 変換器 / 等価性判定アルゴリズム / プッシュダウンオートマトン / learning from positive data / algorithmic learning theory / bioinformatics / generation / branch-and-bound method / maximal clique / 論理関数の学習 / 形式言語の学習 / 正例からの学習 / 列挙アルゴリズム / 重み最大クリーク / 正の例からの学習 / 列挙法 / Identification in the limit / Number of updates / Updating time / Positive example / Automaton / Formal language / Learning / ブール関数 / 極限同定 / 更新回数 / 更新時間 / 正の例 / 形式言語 / 学習 / Approximation algorithm / Coloring problem / Maximal clique / Maximum weight clique / Combinatorial optimization / ニューラルネットワーク / 学習理論 / 色彩問題 / RNA二次構造予測 / 彩色問題 / branch-and-bound / maximum weight clique / algorithm / combinatorial optimization / RNA 2次構造予測 / 確立アルゴリズム / ポルツマンマシン / RNA2次構造予測 / ボルツマンマシン / N-queen problem / Randamized algorithm / Clique / Graph / Neural network / nークィ-ン問題 / Nークィ-ン問題 / 確率化アルゴリズム / ボルツマン機械 / クリ-ク / ニュ-ラルネットワ-ク / 独立節点集合 / 整列 / 近似解 / 疑似クリーク / 分散処理 / DNAコンピューティング / ハイパーグラフ / NP困難問題 / 並列処理 … More Except Principal Investigator 正例からの学習 / 計算論的学習理論 / ニューラルネットワーク / Speech recognition / Neural network / プッシュダウン変換器 / 決定性文脈自由言語 / アルゴリズム / 等価性判定 / 極限同定 / Functional Programming / BC-chain Method / Combinator / Lambda Expression / 計算量 / 関数型プログラミング / BC鎖方式 / コンビネータ / ラムダ式 / NP-complete problem / analogue computation / quantum computation / 量子ニューロイダルネット / 脳型計算 / ニューラルネット / 量子アナログ計算 / 量子ニューラルネット / ニューロイダルネット / 計算機シミュレーション / 断熱量子計算 / グラフの3彩色問題 / アナログ量子計算 / 量子コンピュータ / NP完全問題 / アナログ計算 / 量子計算 / Boltsmann machine / binding / phasor neural network / Covariance / ボレッマンマシン / 機能的結合 / パルスニューロン / 複素ニューロン / ボルツマンマシン / バインディング / 位相ニューロン / コバリアンス / Probably Approximately Correct / Machine learning / Neural networks / 学習 / リカレントネットワーク / 音声認識 / VC dimension / Recurrent network / PAC learning / 分類雑音 / 汎化 / サンプル計算量 / VC次元 / 学習曲線 / リカレントニューラルネット / PAC学習 / 連続音声認識 / Recurrent Propagation / Back Propagation / Learning Algorithm / 線型分離可能性 / 線型分離 / リカレントネットワ-ク / リカレントプロパゲ-ション / バックプロパゲ-ション / ニュ-ラルネットワ-ク / 多項式時間可解性 / 多項式時間可能性 / 包含性判定 / 質問による学習 / 稀少パターン発見 / パターンの摂動 / Emerging Pattern / クリーク制約 / 分枝限定法 / クラスター構造 / クラスタリング / 組み合わせ最適化 / クリーク枚挙 / 情報量変化 / 制約マイニング / 情報量差分 / 変化検出問題 / 変換器 / プッシュダウンオートマトン / ノイズ除去 / k可逆オートマトン / 機械学習アルゴリズム / 言語獲得 / 文法学習 / 鳥の歌文法 / 学習と知識獲得 / クラスタ抽出 / トップN法 / スペクトル / 類似度行列 / 形式概念 / 時系列データ / 擬似クラスタ / 情間マイニング / non-frequent pattern mining / formal concept / maximal clique / inter-information / 内包的接続 / クロスオーバ Less

効率的な最大および極大クリーク抽出アルゴリズムの開発と応用Principal Investigator
- Principal Investigator
  
  富田悦次
- Project Period (FY)
  2017 – 2021
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  The University of Electro-Communications
Much faster algorithms for finding maximum and maximal cliques and their applicationsPrincipal Investigator
- Principal Investigator
  
  TOMITA Etsuji
- Project Period (FY)
  2013 – 2017
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  The University of Electro-Communications
Development of efficient learning algorithms of formal languages and construction of their application systems
- Principal Investigator
  
  WAKATSUKI Mitsuo
- Project Period (FY)
  2011 – 2014
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  The University of Electro-Communications
Development of efficient algorithms for finding a maximum clique with theoretical and experimental evaluations and their applicationsPrincipal Investigator
- Principal Investigator
  
  TOMITA Etsuji
- Project Period (FY)
  2010 – 2012
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  The University of Electro-Communications
Mining Structural Changes
- Principal Investigator
  
  HARAGUCHI Makoto
- Project Period (FY)
  2009 – 2011
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Intelligent informatics
- Research Institution
  Hokkaido University
Modeling the acquisition process of bird song grammars based on computational learning theory
- Principal Investigator
  
  NISHINO Tetsuro
- Project Period (FY)
  2008 – 2010
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Intelligent informatics
- Research Institution
  The University of Electro-Communications
Developments of efficient algorithms for learning from examples of formal languages and their applications
- Principal Investigator
  
  WAKATSUKI Mitsuo
- Project Period (FY)
  2008 – 2010
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  The University of Electro-Communications
Crossover Concept Mining Based on Conceptual Abstraction Hierarchies
- Principal Investigator
  
  MAKOTO Haraguchi
- Project Period (FY)
  2007 – 2008
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Intelligent informatics
- Research Institution
  Hokkaido University
Improvement and extension of maximum-clique-finding algorithms with complexity analysis and their applicationsPrincipal Investigator
- Principal Investigator
  
  TOMITA Etsuji
- Project Period (FY)
  2007 – 2009
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  The University of Electro-Communications
Developments of Efficient Combinatorial Algorithms and Their ApplicationsPrincipal Investigator
- Principal Investigator
  
  TOMITA Etsuji
- Project Period (FY)
  2004 – 2006
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  The University of Electro-Communications
A New Model of Quantum Analogue Computation
- Principal Investigator
  
  NISHINO Tetsuro
- Project Period (FY)
  2001 – 2003
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications
Studies on Efficient Learning Algorithms from ExamplesPrincipal Investigator
- Principal Investigator
  
  TOMITA Etsuji
- Project Period (FY)
  2001 – 2003
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Intelligent informatics
- Research Institution
  The University of Electro-Communications
A neural model of the binding in the human brain and its application to pattern recognition
- Principal Investigator
  
  HARUHISA Takahashi
- Project Period (FY)
  1998 – 2000
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  情報通信工学
- Research Institution
  The Unicersity of Electro-Communications
Development and Applications of Efficient Algorithms for Combinatorial Optimization ProblemsPrincipal Investigator
- Principal Investigator
  
  TOMITA Etsuji
- Project Period (FY)
  1997 – 1998
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications
Real-time speech recognition and model selection via recurrent neural networks
- Principal Investigator
  
  TAKAHASHI Haruhisa
- Project Period (FY)
  1994 – 1995
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  情報通信工学
- Research Institution
  The University of Electro-Communications
Development and Evaluations of Efficient Algorithms for Combinatorial Optimization ProblemsPrincipal Investigator
- Principal Investigator
  
  TOMITA Etsuji
- Project Period (FY)
  1994 – 1995
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications
Mamalian-like neural networks for dynamic information processing and its learning algorithm
- Principal Investigator
  
  TAKAHASHI Haruhisa
- Project Period (FY)
  1992 – 1993
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  電子通信系統工学
- Research Institution
  The University of Electro-Communications
Development and Applications of Learning Algorithms for Neural Networks
- Principal Investigator
  
  TAKAHASHI Haruhisa
- Project Period (FY)
  1990 – 1991
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  電子通信系統工学
- Research Institution
  The University of Elector-Communications
Development and Evaluations of Efficient Algorithms for Finding a Maximum Clique Based upon Nueral NetworksPrincipal Investigator
- Principal Investigator
  
  TOMITA Etsuji
- Project Period (FY)
  1990 – 1991
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  情報工学
- Research Institution
  The Univesity of Electro-Communications
Investigation in ew Algorithms for Checking Equivalence of Discrete Systems and It's ApplicationPrincipal Investigator
- Principal Investigator
  
  KASAI Takumi, 富田悦次
- Project Period (FY)
  1987 – 1988
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  計算機工学
- Research Institution
  The University of Electro-Communications
効率的な極大クリーク抽出アルゴリズムの開発と計算量評価に関する研究Principal Investigator
- Principal Investigator
  
  富田悦次
- Project Period (FY)
  1985 – 1986
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  計算機工学
- Research Institution
  The University of Electro-Communications
A Method for Implementing Functional Programming Languages
- Principal Investigator
  
  NOSHITA Kohei
- Project Period (FY)
  1985 – 1986
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  計算機工学
- Research Institution
  Chuo University
  The University of Electro-Communications

[Book] Journal of Graph Algorithms and Applications2016
- Author(s)
  Sohel Rahman, Etsuji Tomita (Eds.)
- Total Pages
  158
- Publisher
  Journal of Graph Algorithms and Applications
- Data Source
  KAKENHI-PROJECT-25330009
[Book] Journal of Discrete Algorithms2016
- Author(s)
  Sohel Rahman, Etsuji Tomita (Eds.)
- Total Pages
  75
- Publisher
  Elsevier
- Data Source
  KAKENHI-PROJECT-25330009
[Book] Lecture Notes in Computer Science, 89732015
- Author(s)
  Sohel Rahman, Etsuji Tomita (Eds.)
- Total Pages
  336
- Publisher
  Springer
- Data Source
  KAKENHI-PROJECT-25330009
[Book] Clique Enumeration in "Encyclopedia of Algorithms, 2nd Edition"2015
- Author(s)
  Etsuji Tomita
- Total Pages
  6
- Publisher
  Springer
- Data Source
  KAKENHI-PROJECT-25330009
[Book] 森北出版2013
- Author(s)
  富田悦次
- Total Pages
  205
- Publisher
  オートマトン・言語理論（第二版）
- Data Source
  KAKENHI-PROJECT-22500009
[Book] オートマトン・言語理論　第２版2013
- Author(s)
  富田悦次，横森　貴
- Total Pages
  214
- Publisher
  森北出版株式会社
- Data Source
  KAKENHI-PROJECT-25330009
[Book] Biomedical Engineering, Trends in Electronics, Communications and Software2011
- Author(s)
  Eteuji Tomita, Tatsuya Akutsu, Tsutomu Matsunaga(Anthony N.Laskovski Ed.分担執筆)
- Total Pages
  736
- Publisher
  IN-TECR
- Data Source
  KAKENHI-PROJECT-21300047
[Book] Efficient algorithms for finding maximum and maximal cliques : Effective tools for bioinformatics, in"Biomedical Engineering, Trends in Electronics, Communications and Software"2011
- Author(s)
  Etsuji Tomita, Tatsuya Akutsu, Tsutomu Matsunaga
- Total Pages
  16
- Publisher
  InTech
- Data Source
  KAKENHI-PROJECT-22500009
[Book] in "Biomedical Engineering, Trends in Electronics, Communications and Software"(Efficient algorithms for finding maximum and maximal cliques : Effective tools for bioinformatics)2011
- Author(s)
  E.Tomita, T.Akutsu, T.Matsunaga
- Publisher
  A.N.Laskovski(Ed.), InTech
- Data Source
  KAKENHI-PROJECT-20500007
[Book] オートマトン・言語理論(第22刷・改訂増刷)2011
- Author(s)
  富田悦次・横森貴
- Total Pages
  205
- Publisher
  森北出版
- Data Source
  KAKENHI-PROJECT-22500009
[Book] Efficient algorithms for finding maximum and maximal cliques: Effective tools for bioinformatics," in "Biomedical Engineering, Trends in Electronics, Communications and Software2011
- Author(s)
  Etsuji Tomita, Tatsuya Akutsu, Tsutomu Matsunaga
- Publisher
  A. N. Laskovski (Ed.), InTech
- URL
  http://www.intechopen.com/articles/show/title/efficient-algorithms-for-finding-maximum-and-maximal-cliques-effective-tools-for-bioinformatics
- Data Source
  KAKENHI-PROJECT-22500009
[Book] 数理モデルの応用技術 (情報処理学会50年のあゆみ, 第3編中)2010
- Author(s)
  中森眞理雄, 富田悦次
- Total Pages
  3
- Publisher
  情報処理学会
- Data Source
  KAKENHI-PROJECT-22500009
[Book] 数理モデルの応用技術2010
- Author(s)
  中森眞理雄,富田悦次
- Publisher
  情報処理学会
- Data Source
  KAKENHI-PROJECT-22500009
[Book] オートマトン・言語理論(第20刷・改訂増刷)2009
- Author(s)
  富田悦次
- Total Pages
  205
- Publisher
  森北出版
- Data Source
  KAKENHI-PROJECT-19500010
[Book] オートマトン・言語理論(第21刷・改訂増刷)2009
- Author(s)
  富田悦次,横森貴
- Total Pages
  205
- Publisher
  森北出版
- Data Source
  KAKENHI-PROJECT-19500010
[Book] 現代数理科学辞典第2版2009
- Author(s)
  富田悦次(広中平祐, 編,分担執筆)
- Publisher
  丸善
- Data Source
  KAKENHI-PROJECT-21300047
[Book] オートマトン・言語理論 (第21刷・改訂増刷)2009
- Author(s)
  富田悦次
- Total Pages
  205
- Publisher
  森北出版
- Data Source
  KAKENHI-PROJECT-19500010
[Book] 「第2版現代数理科学辞典」,III(形式言語), 2-12009
- Author(s)
  富田悦次
- Publisher
  広中平祐編丸善
- Data Source
  KAKENHI-PROJECT-20500007
[Book] 第2版現代数理科学辞典2009
- Author(s)
  富田悦次
- Total Pages
  1450
- Publisher
  丸善
- Data Source
  KAKENHI-PROJECT-19500010
[Book] オートマトン・言語理論(第21刷・改定増刷)2009
- Author(s)
  富田悦次, 横森貴
- Total Pages
  205
- Publisher
  森北出版
- Data Source
  KAKENHI-PROJECT-20500007
[Book] 現代数理科学辞典第2版2009
- Author(s)
  富田悦次(広中平祐編,分担執筆)
- Total Pages
  1450
- Data Source
  KAKENHI-PROJECT-21300047
[Book] オートマトン・言語理論(第19刷・改訂増刷)2008
- Author(s)
  富田悦次
- Total Pages
  205
- Publisher
  森北出版
- Data Source
  KAKENHI-PROJECT-19500010
[Book] オートマトン・言語理論(第18刷・改訂増刷)2007
- Author(s)
  富田悦次(共著)
- Total Pages
  205
- Publisher
  森北出版
- Data Source
  KAKENHI-PROJECT-16300001
[Book] オートマトン・言語理論 (第18刷・改訂増刷)2007
- Author(s)
  富田悦次 (共著)
- Total Pages
  205
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Book] オートマトン・言語理論(第17刷-改訂増刷)2006
- Author(s)
  富田悦次(共著)
- Total Pages
  205
- Publisher
  森北出版
- Data Source
  KAKENHI-PROJECT-16300001
[Book] オートマトン・言語理論(第16刷・改訂増刷)2005
- Author(s)
  富田悦次(共著)
- Total Pages
  205
- Publisher
  森北出版
- Data Source
  KAKENHI-PROJECT-16300001
[Book] Efficient algorithms for finding maximum and maximal cliques-Effective tools for bioinformatics-" in "Biomedical Engineering, Trends, Researches and Technologies
- Author(s)
  E. Tomita, T. Akutsu, T. Matsunaga
- Publisher
  INTECH
- Data Source
  KAKENHI-PROJECT-19500010
[Book] 数理モデルの応用技術(情報処理学会50周年史,第3編,第17章)
- Author(s)
  中森眞理雄, 富田悦次
- Publisher
  情報処理学会
- Data Source
  KAKENHI-PROJECT-19500010
[Book] オートマトン・言語理論(第二版)
- Author(s)
  富田悦次,横森貴
- Publisher
  森北出版(印刷中)
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms2021
- Author(s)
  Alessio Conte, Etsuji Tomita
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 12635 Pages: 195-207
- DOI
  10.1007/978-3-030-68211-8_16
- ISBN
  9783030682101, 9783030682118
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00006
[Journal Article] Speeding-up of construction algorithms for the graph coloring problem2020
- Author(s)
  Kazuho Kanahara, Kengo Katayama, Takafumi Miyake, Etsuji Tomita
- Journal Title
  
  Lecture Notes in Networks and Systems
  
  Volume: 159 Pages: 211-222
- DOI
  10.1007/978-3-030-61108-8_21
- ISBN
  9783030611071, 9783030611088
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17K00006
[Journal Article] A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments2017
- Author(s)
  TOMITA Etsuji, MATSUZAKI Sora, NAGAO Atsuki, ITO Hiro, and WAKATSUKI Mitsuo
- Journal Title
  
  Journal of Information Processing
  
  Volume: 25 Issue: 0 Pages: 667-677
- DOI
  10.2197/ipsjjip.25.667
- NAID
  130005990921
- ISSN
  1882-6652
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-15K11985, KAKENHI-PROJECT-25330009, KAKENHI-PROJECT-17K00006
[Journal Article] A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs2016
- Author(s)
  Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo and Etsuji Tomita
- Journal Title
  
  Proceedings of the 20th Pacific Asia Conference on Knowledge Discovery and Data Mining - PAKDD 2016 (Part I)
  
  Volume: LNAI 9651 Pages: 423-435
- DOI
  10.1007/978-3-319-31753-3_34
- ISBN
  9783319317526, 9783319317533
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26330243, KAKENHI-PROJECT-16K00291, KAKENHI-PROJECT-25330009
[Journal Article] Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound,2016
- Author(s)
  Yoshiaki Okubo, Makoto Haraguchi and Etsuji Tomita
- Journal Title
  
  Proceedings of the 12th International Conference on Machine Learning and Data Mining - MLDM 2016
  
  Volume: LNAI 9729 Pages: 569-583
- DOI
  10.1007/978-3-319-41920-6_45
- ISBN
  9783319419190, 9783319419206
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26330243, KAKENHI-PROJECT-16K00291, KAKENHI-PROJECT-25330009
[Journal Article] A Much Faster Algorithm for Finding a Maximum Clique2016
- Author(s)
  Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito and Mitsuo Wakatsuki
- Journal Title
  
  roceedings of the 10th International Frontiers of Algorithmics Workshop (FAW2016)
  
  Volume: 未定 Pages: 215-226
- DOI
  10.1007/978-3-319-39817-4_21
- ISBN
  9783319398167, 9783319398174
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-24650006, KAKENHI-PROJECT-25330009, KAKENHI-PROJECT-15K11985
[Journal Article] A Fast and Complete Algorithm for Enumerating Pseudo-Cliques in Large Graphs2016
- Author(s)
  Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo and Etsuji Tomita
- Journal Title
  
  Journal of Data Science and Analytics
  
  Volume: 2(3-4) Issue: 3-4 Pages: 145-158
- DOI
  10.1007/s41060-016-0022-1
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-26330243, KAKENHI-PROJECT-16K00291, KAKENHI-PROJECT-25330009
[Journal Article] Enumerating maximal clique sets with pseudo-clique constraint2015
- Author(s)
  Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
- Journal Title
  
  Lecture Notes in Artificial Intelligence
  
  Volume: 9356 Pages: 324-339
- DOI
  10.1007/978-3-319-24282-8_28
- ISBN
  9783319242811, 9783319242828
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330009, KAKENHI-PROJECT-26330243
[Journal Article] A polynomial-time algorithm for checking the equivalence of deterministic restricted one-counter transducers which accept by final state2015
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino
- Journal Title
  
  Studies in Computational Intelligence, "Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing"
  
  Volume: 569 Pages: 131-144
- DOI
  10.1007/978-3-319-10389-1_10
- ISBN
  9783319103884, 9783319103891
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-23500011, KAKENHI-PROJECT-25330009
[Journal Article] 最大クリーク問題の多項式時間的可解性の拡張の改良2014
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Journal Title
  
  電子情報通信学会論文誌 D
  
  Volume: J97-D Pages: 1106-1121
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330009
[Journal Article] 最大クリーク問題の多項式時間的可解性の拡張の改良2014
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Journal Title
  
  電子情報通信学会論文誌
  
  Volume: J97-D Pages: 1-16
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330009
[Journal Article] 最大クリーク問題の多項式時間的可解性の拡張の改良2014
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Journal Title
  
  電子情報通信学会論文誌Ｄ
  
  Volume: J97-D (6) Pages: 1106-1121
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500011
[Journal Article] A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments2013
- Author(s)
  Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E96.D Issue: 6 Pages: 1286-1298
- DOI
  10.1587/transinf.E96.D.1286
- NAID
  10031193989
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330009
[Journal Article] A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments2013
- Author(s)
  Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki
- Journal Title
  
  IEICE Transactions on Information and Systems
  
  Volume: E96-D (6) Pages: 1286-1298
- NAID
  10031193989
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500011
[Journal Article] A polynomial-time algorithm for checking the equivalence for real-time deterministic restricted one-counter transducers which accept by final state2013
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino
- Journal Title
  
  Proc. IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing
  
  Volume: 14 Pages: 1-6
- DOI
  10.1109/snpd.2013.18
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330009
[Journal Article] A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments2013
- Author(s)
  Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki
- Journal Title
  
  IEICE Trans. on Information and Systems
  
  Volume: vol.E96-D,no.6
- NAID
  10031193989
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] A polynomial-time algorithm for checking the equivalence for real-time deterministic restricted one-counter transducers which accept by final state2013
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino
- Journal Title
  
  International Journal of Computer and Information Science
  
  Volume: 14 (2) Pages: 45-53
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500011
[Journal Article] Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication2013
- Author(s)
  M. Villagra, M. Nakanishi, S. Yamashita, and Y. Nakashima
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E96.D Issue: 1 Pages: 1-8
- DOI
  10.1587/transinf.E96.D.1
- NAID
  10031167374
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21700016, KAKENHI-PROJECT-22500009, KAKENHI-PROJECT-23240001, KAKENHI-PROJECT-23500018, KAKENHI-PROJECT-24500003, KAKENHI-PLANNED-24106009
[Journal Article] Relational Change Pattern Mining Based on Modularity Difference2013
- Author(s)
  Yoshiaki Okubo, Makoto Haraguchi and Etsuji Tomita
- Journal Title
  
  Lecture Notes in Artificial Intelligence
  
  Volume: 8271 Pages: 187-198
- DOI
  10.1007/978-3-642-44949-9_18
- ISBN
  9783642449482, 9783642449499
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500165, KAKENHI-PROJECT-25330009
[Journal Article] Relational change pattern mining based on modularity difference2012
- Author(s)
  Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita
- Journal Title
  
  Proc. International Workshop on Information Search, Integration and Personalization
  
  Pages: 1-10
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク問題の多項式時間的可解性の拡張2012
- Author(s)
  中西裕陽,富田悦次,若月光夫,西野哲朗
- Journal Title
  
  電子情報通信学会論文誌D
  
  Volume: vol.J95-D,no.9 Pages: 1716-1728
- NAID
  110009495570
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] Structural change pattern mining based on constrained maximal k-plex search2012
- Author(s)
  Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita
- Journal Title
  
  Lecture Notes in Artificial Intelligence
  
  Volume: 7569 Pages: 284-298
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] Finding what changes for two graphs constructed from different time intervals2012
- Author(s)
  Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
- Journal Title
  
  Proc. the 2012 IIAI International Conference on Advanced Applied Informatics
  
  Pages: 48-53
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク問題の多項式時間的可解性の拡張2012
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Journal Title
  
  電子情報通信学会論文誌Ｄ
  
  Volume: J95-D Pages: 1716-1728
- NAID
  110009495570
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500011
[Journal Article] A clique-based method using dynamic programming for computing edit distance between unordered trees2012
- Author(s)
  Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu
- Journal Title
  
  Journal of Computational Biology
  
  Volume: 19 Pages: 1089-1104
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] Learning Boolean functions in AC^0 on attribute and classification noise-Estimating an upper bound on attribute and classification nose2011
- Author(s)
  A.Miyata, J.Tarui, E.Tomita
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 412 Pages: 4650-4660
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 実時間最終状態受理式決定性限定1カウンタ変換器の多項式時間等価性判定アルゴリズム2011
- Author(s)
  若月光夫，清野和司，富田悦次，西野哲朗
- Journal Title
  
  京都大学数理解析研究所講究録
  
  Volume: 1744 Pages: 1-10
- Data Source
  KAKENHI-PROJECT-23500011
[Journal Article] 最大クリーク問題の多項式時間的可解性について2011
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Journal Title
  
  京都大学数理解析研究所講究録
  
  Volume: 1744 Pages: 169-176
- Data Source
  KAKENHI-PROJECT-23500011
[Journal Article] A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures2011
- Author(s)
  Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu
- Journal Title
  
  BMC Bioinformatics
  
  Volume: 12:S13 Pages: 1-9
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] Biomedical Engineering, Trends in Electronics2011
- Author(s)
  E. Tomita, T. Akutsu and T. Matsunaga
- Journal Title
  
  Communications and Software Anthony N. Laskovski (ed.)
  
  Pages: 625-640
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300047
[Journal Article] 最大クリーク問題の多項式時間的可解性の更なる改良結果2011
- Author(s)
  中西裕陽, 富田悦次, 若月光夫, 西野哲朗
- Journal Title
  
  電子情報通信学会論文誌D
  
  Volume: J94-D Pages: 2037-2046
- NAID
  110008798722
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク問題の多項式時間的可解性について2011
- Author(s)
  中西裕陽,富田悦次,若月光夫,西野哲朗
- Journal Title
  
  京都大学数理解析研究所講究録
  
  Volume: vol.1744 Pages: 169-176
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 実時間最終状態受理式決定性限定1カウンタ変換器の多項式時間等価性判定アルゴリズム2011
- Author(s)
  若月光夫,清野和司,富田悦次,西野哲朗
- Journal Title
  
  京都大学数理解析研究所講究録
  
  Volume: vol.1744 Pages: 1-10
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] Learning Boolean functions in AC0 on attribute and classification noise - Estimating an upper bound on attribute and classification noise2011
- Author(s)
  Akinobu Miyata, Jun Tarui, Etsuji Tomita
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 412 Pages: 4650-4660
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク問題の多項式時間的可解性の更なる改良結果2011
- Author(s)
  中西裕陽,富田悦次,若月光夫,西野哲朗
- Journal Title
  
  電子情報通信学会論文誌D
  
  Volume: J94-D,no.12 Pages: 2037-2046
- NAID
  110008798722
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 実時間最終状態受理式決定性限定1カウンタ変換器の多項式時間等価性判定アルゴリズム2011
- Author(s)
  若月光夫, 清野和司, 富田悦次, 西野哲朗
- Journal Title
  
  京都大学数理解析研究所講究録
  
  Volume: 1744 Pages: 1-10
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク抽出の単純な最大時間計算量評価と多項式時間的可解性2011
- Author(s)
  中西裕陽, 富田悦次, 若月光夫, 西野哲朗
- Journal Title
  
  京都大学数理解析研究所講究録
  
  Volume: 1744 Pages: 169-176
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク問題の多項式時間的可解性の更なる改良結果2011
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Journal Title
  
  電子情報通信学会論文誌Ｄ
  
  Volume: J94-D Pages: 2037-2046
- NAID
  110008798722
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500011
[Journal Article] An improved clique-based method for the edit distance between unordered trees with application to similar glycan structures2011
- Author(s)
  Tatsuya Akutsu, Tomoya Mori, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura, Etsuji Tomita
- Journal Title
  
  Proc. International Conference on Complex, Intelligent and Software Intensive Systems
  
  Pages: 536-540
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク問題の多項式時間的可解性の改良結果2011
- Author(s)
  中西裕陽,富田悦次
- Journal Title
  
  電子情報通信学会論文誌D
  
  Volume: vol.J94-D,no.5 Pages: 843-851
- NAID
  110008676162
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク問題の多項式時間的可解性の改良結果2011
- Author(s)
  中西裕陽, 富田悦次
- Journal Title
  
  電子情報通信学会論文誌D
  
  Volume: J94-D Pages: 843-851
- NAID
  110008676162
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] Polynomial time identification of strict prefix deterministic finite state transducers2010
- Author(s)
  若月光夫, 富田悦次
- Journal Title
  
  Lecture Notes in Artificial Intelligence Vol.6339
  
  Pages: 313-316
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500007
[Journal Article] 最大クリーク問題の多項式時間的可解性の-結果2010
- Author(s)
  中西裕陽, 富田悦次
- Journal Title
  
  電子情報通信学会論文誌D
  
  Volume: J93-D Pages: 417-425
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] A simple and faster branch-and-bound algorithm for finding a maximum clique2010
- Author(s)
  E.Tomita, Y.Sutani, T.Higashi, S.Takahashi, M.Wakatsuki
- Journal Title
  
  Lecture Notes in Computer Science Vol.5942
  
  Pages: 191-203
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500007
[Journal Article] Polynomial time identification of strict prefix deterministic finite state transducers2010
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita
- Journal Title
  
  Lecture Notes in Artificial Intelligence
  
  Volume: 6339 Pages: 313-316
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク抽出の単純な最大時間計算量評価と多項式時間的可解性2010
- Author(s)
  中西裕陽,富田悦次,若月光夫
- Journal Title
  
  京都大学数理解析研究所講究録
  
  Volume: vol.1691 Pages: 108-114
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique2010
- Author(s)
  E. Tomita, Y. Sutani, T. Higashi, S.Takahashi and M. Wakatsuki
- Journal Title
  
  Proc. of International Workshop on Algorithms and Computation
  
  Pages: 191-203
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300047
[Journal Article] 最大クリーク問題の多項式時間的可解性の一結果2010
- Author(s)
  中西裕陽,富田悦次
- Journal Title
  
  電子情報通信学会論文誌D
  
  Volume: vol.J93-D,no.4 Pages: 417-425
- NAID
  110007593175
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] 最大クリーク問題の多項式時間的可解性の一結果2010
- Author(s)
  中西裕陽, 富田悦次
- Journal Title
  
  電子情報通信学会論文誌D
  
  Volume: J93-D Pages: 417-425
- NAID
  110007593175
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300047
[Journal Article] Polynomial time identification of strict prefix deterministic finitestate transducers2010
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 6339 Pages: 313-316
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] A simple and faster branch-and-bound algorithm for finding a maximum clique2010
- Author(s)
  Etsuji Tomita
- Journal Title
  
  Lecture Notes in Computer Science 5942
  
  Pages: 191-203
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] Polynomial time identification of strict prefix deterministic finite state transducers2010
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita
- Journal Title
  
  Lecture Notes in Artificial Intelligence, Proceedings of ICGI2010 (Springer)
  
  Volume: 6339 Pages: 313-316
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500007
[Journal Article] 最大クリーク抽出の単純な最大時間計算量評価と多項式時間的可解性2010
- Author(s)
  中西裕陽, 富田悦次, 若月光夫
- Journal Title
  
  京都大学数理解析研究所講究録
  
  Volume: 1691 Pages: 108-114
- Data Source
  KAKENHI-PROJECT-22500009
[Journal Article] A simple and Faster Branch-and -Bound Algorithm for Finding a Maximum Clique2010
- Author(s)
  E.Tomita, Y.Sutani, T.Higashi, S.Takahashi, M.Wakatsuki
- Journal Title
  
  Proc.of International Workshop on Algorithms and Computation 2010 Springer-LNCS 5942
  
  Pages: 191-203
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300047
[Journal Article] A simple and faster branch-and-bound algorithm for finding a maximum clique2010
- Author(s)
  E. Tomita, Y. Sutani, T. Higashi, S. Takahashi, M. Wakatsuki
- Journal Title
  
  Lecture Notes in Computer Science 5942
  
  Pages: 191-203
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] 先進的アルゴリズムに向けて2009
- Author(s)
  富田悦次
- Journal Title
  
  電気通信大学紀要 21(招待論文)
- NAID
  120006315644
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] Clique-based data minig for related genes in a biomedical database2009
- Author(s)
  T.Matsunaga, C.Yonemori, E.Tomita, M.Muramatsu
- Journal Title
  
  BMC Bioinformatics Vol.10, No.205
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500007
[Journal Article] Clique-based data mining for related genes in a biomedical database2009
- Author(s)
  T. Matsunaga, C. Yonemori, E. Tomita, M. Muramatsu
- Journal Title
  
  BMC Bioinformatics Online Journal
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] クリークを用いた企業間関係の構造分析2009
- Author(s)
  米森力, 松永務, 関根純, 富田悦次
- Journal Title
  
  日本データベース学会論文誌 7
  
  Pages: 55-60
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data2008
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita
- Journal Title
  
  IEICE Transactions on Information and Systems E91-D
  
  Pages: 1704-1718
- NAID
  110003178820
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500007
[Journal Article] 実時間空スタック受理式決定性限定ワンカウンター変換器の多項式時間等価性判定2008
- Author(s)
  清野和司, 富田悦次, 若月光夫
- Journal Title
  
  電子情報通信学会論文誌D Vol.J91-D, No.5
  
  Pages: 1188-1201
- NAID
  110007380111
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500007
[Journal Article] 実時間空スタック受理式決定性限定ワンカウンタ変換器対の多項式時間等価性判定2008
- Author(s)
  清野和司, 富田悦次, 若月光夫
- Journal Title
  
  電子情報通信学会論文誌D J91-D
  
  Pages: 1188-1201
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] 先進的アルゴリズムに向けて2008
- Author(s)
  富田悦次
- Journal Title
  
  電気通信大学紀要 21
  
  Pages: 11-18
- NAID
  120006315644
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] 実時間空スタツク受理式決定性限定ワンカウンタ変換器の多項式時間等価性判定2008
- Author(s)
  清野和司, 富田悦次, 若月光夫
- Journal Title
  
  電子情報通信学会論文誌D分冊 J91-D
  
  Pages: 1188-1201
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500007
[Journal Article] Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data2008
- Author(s)
  若月光夫, 富田悦次
- Journal Title
  
  IEICE Transactions on Information and Systems Vol.E91-D, No.6
  
  Pages: 1704-1718
- NAID
  110003178820
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500007
[Journal Article] Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data2008
- Author(s)
  M. Wakatsuki, E. Tomita
- Journal Title
  
  IEICE Trans. on Inform. Syst. E91-D
  
  Pages: 1704-1718
- NAID
  110003178820
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] 最大クリーク問題の多項式時間的可解性-基本的結果-2008
- Author(s)
  中西裕陽, 富田悦次
- Journal Title
  
  FIT2008
  
  Pages: 1-4
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] A more efficient algorithm for finding a maximum clique with an improved approximate coloring2007
- Author(s)
  Etsuji Tomita
- Journal Title
  
  International Conference on Parallel and Distributed Processing Techniques and Apphcations 2007
  
  Pages: 719-725
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments2007
- Author(s)
  E. Tomita, T. Kameda
- Journal Title
  
  Journal of Global Optimization 37
  
  Pages: 95-111
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments2007
- Author(s)
  E.Tomita, T.Kameda
- Journal Title
  
  Journal of Global Optimization vol.37
  
  Pages: 95-111
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] A more efficient algorithm for finding a maximum clique with an improved approximate coloring2007
- Author(s)
  Etsuji Tomita
- Journal Title
  
  International Conference on Parallel and Distributed Processing Techniques Applications (to appear)
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] A more efficient algorithm for finding a maximum clique with an improved approximate coloring2007
- Author(s)
  E.Tomita, Y.Sutani, T.Higashi
- Journal Title
  
  Proc. International Conference on Parallel and Distributed Processing Techniques and Applications (2007, to appear)
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] Guest editors' foreword2007
- Author(s)
  H.U. Simon, E. Tomita(Eds. )
- Journal Title
  
  Theoretical Computer Science 387
  
  Pages: 1-3
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments2007
- Author(s)
  Etsuji Tomita
- Journal Title
  
  Journal of Global Optimization 37・1
  
  Pages: 95-111
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] ε-推移を許したある決定性プッシュダウン変換器対の等価性判定2007
- Author(s)
  清野和司, 富田悦次, 若月光夫
- Journal Title
  
  電子情報通信学会論文誌D J90-D
  
  Pages: 2675-2690
- NAID
  110007380576
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Journal Article] An efficient branch-and-abound algorithm for finding a maximum clique with computational experiments2007
- Author(s)
  Etsuji Tomita
- Journal Title
  
  Journal of Global Optimization 37・1
  
  Pages: 95-111
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] Protein threading with profiles and distance constraints using clique based algorithms2006
- Author(s)
  D.Bahadur K.C, E.Tomita, J.Suzuki, K.Horimoto, T.Akutsu
- Journal Title
  
  Journal of Bioinformatics and Computational Biology vol.4
  
  Pages: 19-42
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] The worst-case time complexity for generating all maximal cliques and computational experiments2006
- Author(s)
  Etsuji Tomita
- Journal Title
  
  Theoretical Computer Science (to appear)
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] A unified algorithm for extending classes of languages identifiable in the limit from positive data2006
- Author(s)
  M.Wakatsuki, E.Tomita, G.Yamada
- Journal Title
  
  Lecture Notes in Artificial Intelligence 4201
  
  Pages: 161-174
- NAID
  110002812593
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] Dynamic programming and clique based approaches for protein threading with profiles and constraints2006
- Author(s)
  T.Akutsu, M.Hayashida, D.Bahadur K.C, E.Tomita, J.Suzuki, K.Horimoto
- Journal Title
  
  IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences vol.E89A
  
  Pages: 1215-1222
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] The worst-case time complexity for generating all maximal cliques and computational experiments2006
- Author(s)
  Etsuji Tomita
- Journal Title
  
  Theoretical Computer Science 363・1
  
  Pages: 28-42
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] The worst-case time complexity for generating all maximal cliques and computational experiments2006
- Author(s)
  E.Tomita, A.Tanaka, H.Takahashi
- Journal Title
  
  Theoretical Computer Science vol.363
  
  Pages: 28-42
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] Protein side-chain packing problem : A maximum edge-weight clique algorithmic approach2005
- Author(s)
  D.Bahadur K.C, E.Tomita, J.Suzuki, T.Akutsu
- Journal Title
  
  Journal of Bioinformatics and Computational Biology vol.3
  
  Pages: 103-126
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] Learning Boolean functions in AC^O on attribute and classification noise2004
- Author(s)
  A.Miyata, J.Tarui, E.Tomita
- Journal Title
  
  Lecture Notes in Artificial Intelligence vol.3244
  
  Pages: 142-155
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data2004
- Author(s)
  M.Wakatsuki, K.Teraguchi, E.Tomita
- Journal Title
  
  Lecture Notes in Artificial Intelligence 3264
  
  Pages: 260-272
- NAID
  110003178820
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] Polynomial time learning of simple deterministic languages via queries and a representative sample2004
- Author(s)
  Y.Tajima, E.Tomita, M.Wakatsuki, M.Terada
- Journal Title
  
  Theoretical Computer Science vol.329
  
  Pages: 203-221
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] The worst-case time complexity for generating all maximal cliques2004
- Author(s)
  Etsuji Tomita
- Journal Title
  
  Lecture Notes in Computer Science Vol.3106
  
  Pages: 161-170
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] A faster algorithm for finding a maximum clique2004
- Author(s)
  A.Morita, E.Tomita, T.Kameda
- Journal Title
  
  Information Technology Letters vol.4
  
  Pages: 19-22
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16300001
[Journal Article] 最大クリーク問題の多項式時間的可解性の一結果
- Author(s)
  中西裕陽, 富田悦次
- Journal Title
  
  電子情報通信学会論文誌D J93-D(採録決定)
- NAID
  110007593175
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク抽出アルゴリズムMCTのさらなる高速化2021
- Author(s)
  柳澤士朗, 富田悦次, 片山謙吾, 金原一歩, 戸田貴久, 伊藤大雄, 若月光夫, 西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク列挙を用いた最良な多元単一削除訂正符号の構成2021
- Author(s)
  光武　朗, 野崎隆之, 富田悦次
- Organizer
  電子情報通信学会　情報理論研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] A hyper-heuristic for the maximum clique problem2021
- Author(s)
  Kazuho Kanahara, Kengo Katayama, Etsuji Tomita
- Organizer
  IEICE Technical Committee on Theoretical Foundations of Computing
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク抽出アルゴリズムMCTのさらなる高速化2021
- Author(s)
  柳澤士朗, 富田悦次, 片山謙吾, 金原一歩, 戸田貴久, 伊藤大雄, 若月光夫, 西野哲朗
- Organizer
  電子情報通信学会　コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク列挙を用いた最良な多元単一削除訂正符号の構成2021
- Author(s)
  光武朗, 野崎隆之, 富田悦次
- Organizer
  電子情報通信学会情報理論研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] The maximum clique problem and its applications2020
- Author(s)
  Etsuji Tomita
- Organizer
  Kyoto University, Joint Bioinformatics Education Program
- Invited
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] The Performance of a Metaheuristic Algorithm for Finding a Maximal Weight Clique in the Fill-in-Blank Problem2020
- Author(s)
  Kazuho Kanahara, Kengo Katayama, Nobuo Funabiki and Etsuji Tomita
- Organizer
  International Conference on Information and Education Technology (ICIET 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms2020
- Author(s)
  Alessio Conte, Etsuji Tomita
- Organizer
  International Workshop on Enumeration Problems & Applications
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] Another time-complexity analysis for maximal clique enumeration algorithm CLIQUES2020
- Author(s)
  Etsuji Tomita, Alessio Conte
- Organizer
  IEICE Technical Committee on Theoretical Foundations of Computing
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] The performance of a metaheuristic algorithm for finding a maximal weight clique in the fill-in-blank problem2020
- Author(s)
  Kazuho Kanahara, Kengo Katayama, Nobuo Funabiki, Etsuji Tomita
- Organizer
  International Conference on Information and Education Technology (ICIET 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] The Maximum Clique Problem and Its Applications2020
- Author(s)
  Etsuji Tomita
- Organizer
  Kyoto Unoversity, Joint Bioinformatics Education Program
- Invited
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES2020
- Author(s)
  Etsuji Tomita, Alessio Conte
- Organizer
  IEICE Technical Committee on Theoretical Foundations of Computing
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] グラフ彩色問題における解構築法の効率化2019
- Author(s)
  金原一歩, 片山謙吾, 富田悦次, 岡野傑士, 三宅孝史, 西原典孝
- Organizer
  情報科学技術フォーラム
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] ビッグデータ～最大, 極大クリーク抽出によるビッグデータ分析2019
- Author(s)
  富田悦次
- Organizer
  非営利法人日本シンクタンクアカデミー月例政策研究会
- Invited
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク問題に対する探索頻度情報にもとづく反復k-opt局所探索法の性能2019
- Author(s)
  金原一歩, 片山謙吾, 富田悦次, 松崎空良
- Organizer
  人工知能学会人工知能基本問題研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] グラフ彩色問題における解構築法の効率化2019
- Author(s)
  金原一歩，片山謙吾，富田悦次，岡野傑士，三宅孝史．西原典孝
- Organizer
  電子情報通信学会　コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク問題に対する探索頻度情報にもとづく反復k-opt局所探索法の性能2019
- Author(s)
  金原一歩，片山謙吾，富田悦次，松崎空良
- Organizer
  人工知能学会人工知能基本問題研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] グラフ彩色問題における解構築法の効率化2019
- Author(s)
  金原一歩，片山謙吾，富田悦次，岡野傑士，三宅孝史．西原典孝
- Organizer
  情報科学技術フォーラム
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク全列挙アルゴリズムと符号理論への応用2019
- Author(s)
  富田悦次
- Organizer
  北海道大学大学院情報科学研究科情報理工学専攻知識ソフトウェア科学講座企画学術講演会
- Invited
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] ビッグデータ　～　最大，極大クリーク抽出によるビッグデータ分析2019
- Author(s)
  富田悦次
- Organizer
  非営利法人日本シンクタンクアカデミー月例政策研究会
- Invited
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク抽出アルゴリズムMCTの高速化（その２）2019
- Author(s)
  松崎空良, 富田悦次, 長尾篤樹, 伊藤大雄, 若月光夫, 西野哲朗，片山謙吾，金原一歩
- Organizer
  冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] Enumeration of maximum cliques and its application to coding theory2019
- Author(s)
  Etsuji Tomita
- Organizer
  Dagstuhl Seminar
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] Enumeration of Maximum Cliques and Its Application to Coding Theory2019
- Author(s)
  Etsuji Tomita
- Organizer
  Dagstuhl Seminar
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] グラフ彩色問題における解構築法の効率化2019
- Author(s)
  金原一歩, 片山謙吾, 富田悦次, 岡野傑士, 三宅孝史, 西原典孝
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク全列挙アルゴリズムと符号理論への応用2019
- Author(s)
  富田悦次
- Organizer
  北海道大学大学院情報科学研究科情報理工学専攻知識ソフトウエア科学講座企画学術講演会
- Invited
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク抽出アルゴリズムMCTの高速化(その2)2019
- Author(s)
  松崎空良, 富田悦次, 長尾篤樹, 伊藤大雄, 若月光夫, 西野哲朗, 片山謙吾, 金原一歩
- Organizer
  冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 効率的な最大および極大クリーク抽出アルゴリズムとその応用2018
- Author(s)
  富田悦次
- Organizer
  電子情報通信学会中国支部学術講演会
- Invited
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 近似最大クリーク抽出アルゴリズムIKLSの反復回数に対する適切な制御方法2018
- Author(s)
  長尾篤樹, 松崎空良, 富田悦次, 伊藤大雄, 若月光夫, 西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク列挙による最良な多元単一削除訂正符号の構成2018
- Author(s)
  光武朗，野崎隆之，富田悦次
- Organizer
  情報理論とその応用シンポジウム
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 効率的な最大および極大クリーク抽出アルゴリズムとその応用2018
- Author(s)
  富田悦次
- Organizer
  電子情報通信学会中国支部学術講演会
- Invited
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 最大クリーク抽出アルゴリズムMCTの高速化2018
- Author(s)
  松崎空良, 富田悦次, 長尾篤樹, 伊藤大雄, 若月光夫, 西野哲朗
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 最大クリーク列挙による最良な多元単一削除訂正符号の構成2018
- Author(s)
  光武朗, 野崎隆之, 富田悦次
- Organizer
  情報理論とその応用シンポジウム
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] 近似最大クリーク抽出アルゴリズムIKLS の反復回数に対する適切な制御方法2018
- Author(s)
  長尾篤樹, 松崎空良, 富田悦次, 伊藤大雄, 若月光夫, 西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] Efficient algorithms for finding maximum and maximal cliques2017
- Author(s)
  Etsuji Tomita
- Organizer
  北海道大学大学院情報科学研究科情報理工学専攻講演会
- Invited
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] Efficient algorithms for finding maximum and maximal cliques2017
- Author(s)
  EtsujiTomita
- Organizer
  北海道大学大学院情報科学研究科情報理工学専攻講演会
- Invited
- Data Source
  KAKENHI-PROJECT-17K00006
[Presentation] Efficient algorithms for finding maximum and maximal cliques and their applications2017
- Author(s)
  Etauji Tomita
- Organizer
  The 11th International Conference and Workshops on Algorithms and Computation
- Place of Presentation
  National Chiao Tung University, Hsinchu, Taiwan
- Year and Date
  2017-03-29
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] Efficient algorithms for finding maximum and maximal cliques2017
- Author(s)
  Etsuji Tomita
- Organizer
  北海道大学大学院情報科学研究科情報理工学専攻講演会
- Invited
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 可変接続数下限を用いた孤立性j-核2016
- Author(s)
  趙奇, 原口誠, 大久保好章, 富田悦次
- Organizer
  人工知能学会人工知能基本問題研究会
- Place of Presentation
  湯の原ホテル(宮城県仙台市青葉区)
- Year and Date
  2016-01-21
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 最大クリーク抽出アルゴリズムMCSの高速化2016
- Author(s)
  吉田幸平，八田拓郎，富田悦次，長尾篤樹，伊藤大雄，若月光夫
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  電気通信大学(東京都調布市)
- Year and Date
  2016-03-06
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 最終状態受理式決定性限定１カウンタ変換器の多項式時間包含性判定アルゴリズム2016
- Author(s)
  若月光夫, 富田悦次, 西野哲朗
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学(京都市左京区)
- Year and Date
  2016-01-26
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] Enumerating Maximal Clique Sets with K-plex Constraint by using Meta-clique2015
- Author(s)
  Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
- Organizer
  人工知能学会全国大会
- Place of Presentation
  はこだて未来大学(北海道函館市)
- Year and Date
  2015-05-30
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] Efficient algorithms for finding maximum and maximal cliques2015
- Author(s)
  Etsuji Tomita
- Organizer
  International Spring School on Algorithms and Applications (ISSAA 2015)
- Place of Presentation
  Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
- Year and Date
  2015-02-25
- Invited
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 最大クリーク抽出アルゴリズムの高速化2015
- Author(s)
  八田拓郎，富田悦次, 伊藤大雄，若月光夫
- Organizer
  夏のLAシンポジウム
- Place of Presentation
  ゆのくに天祥(石川県加賀市)
- Year and Date
  2015-07-14
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 大規模グラフにおける疑似クリーク厳密解全列挙に関する考察2015
- Author(s)
  大久保好章，ジェイ泓杰, 原口誠, 富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  電気通信大学(東京都調布市)
- Year and Date
  2015-12-15
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] A polynomial-time algorithm for checking the equivalence of deterministic restricted one-counter transducers which accept by final state2014
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino
- Organizer
  15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD2014)
- Place of Presentation
  Harrah's Casino Hotel, Las Vegas, U.S.A.
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] 実時間決定性限定１カウンタ変換器に対する質問による多項式時間学習アルゴリズム2014
- Author(s)
  若月光夫，富田悦次，西野哲朗
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 疑似独立集合制約と正規化カットを用いたグラフの構造比較2013
- Author(s)
  間澤直寛,ジェイ泓杰,原口誠,富田悦次
- Organizer
  人工知能学会全国大会
- Place of Presentation
  富山国際会議場
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 決定性限定1カウンタ変換器のある部分クラスに対する質問による多項式時間学習アルゴリズム2013
- Author(s)
  若月光夫, 富田悦次, 西野哲朗
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 疑似独立集合制約と正規化カットを用いたグラフの構造比較2013
- Author(s)
  間澤直寛,原口誠,富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  武雄文化会館.
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] A polynomial-time algorithm for checking the equivalence for real-time deterministic restricted one-counter transducers which accept by final state2013
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino
- Organizer
  14th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD2013)
- Place of Presentation
  The Sheraton Waikiki Hotel, Honolulu, Hawaii, U.S.A.
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] 最終状態受理式決定性限定1カウンタ変換器の多項式時間等価性判定アルゴリズム2012
- Author(s)
  若月光夫，清野和司，富田悦次，西野哲朗
- Organizer
  2011年度冬のLAシンポジウム
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] クリーク全列挙に基づく構造変化検出アルゴリズム2012
- Author(s)
  エラウィンディサラ,原口誠,大久保好章,富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  指宿市市民会館
- Year and Date
  2012-03-12
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] クリーク全列挙に基づく構造変化検出アルゴリズム2012
- Author(s)
  エラウィンディサラ・原口誠・大久保好章・富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  指宿市民会館(鹿児島県指宿市)
- Year and Date
  2012-03-02
- Data Source
  KAKENHI-PROJECT-21300047
[Presentation] 最終状態受理式決定性限定1カウンタ変換器の多項式時間等価性判定アルゴリズム2012
- Author(s)
  若月光夫,清野和司,富田悦次,西野哲朗
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 極大k-plex探索による外部接続度を考慮した構造変化抽出2012
- Author(s)
  大久保好章,原口誠,富田悦次
- Organizer
  ERATO湊離散構造処理系プロジェクト「2012年度秋のワークショップ」
- Place of Presentation
  ゆうばりホテルシューパロ
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] クリーク全列挙に基づく構造変化検出アルゴリズム2012
- Author(s)
  エラウィンディサラ・原口誠・大久保好章・富田悦次
- Organizer
  情報処理学会・数理モデル化と問題解決研究会
- Place of Presentation
  指宿市民会館(鹿児島県指宿市)
- Year and Date
  2012-03-02
- Data Source
  KAKENHI-PROJECT-21300047
[Presentation] 最大クリーク問題の多項式時間的可解性の拡張2011
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  東北大学
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] 変化検出のための極大整合連結集合2011
- Author(s)
  原口誠,大久保好章,富田悦次,吉岡真治
- Organizer
  人工知能学会人工知能基本問題研究会
- Place of Presentation
  慶応大学
- Year and Date
  2011-12-16
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 実時間最終状態受理式決定性限定1カウンタ変換器の多項式時間等価性判定アルゴリズム2011
- Author(s)
  若月光夫,清野和司,富田悦次,西野哲朗
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学
- Year and Date
  2011-02-13
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 最大・極大クリーク抽出アルゴリズムとその応用2011
- Author(s)
  富田悦次
- Organizer
  東京工業大学GCOEセミナー
- Place of Presentation
  東京工業大学
- Year and Date
  2011-12-19
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 最大・極大クリーク抽出アルゴリズムとその応用2011
- Author(s)
  富田悦次
- Organizer
  東京工業大学 GCOEセミナー
- Place of Presentation
  東京工業大学(招待講演)
- Year and Date
  2011-12-19
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 変化検出のための極大整合連結集合2011
- Author(s)
  原口誠・大久保好章・富田悦次・吉岡真治
- Organizer
  人工知能学会・基本問題研究会
- Place of Presentation
  慶応義熟大学(神奈川県横浜市)
- Year and Date
  2011-12-15
- Data Source
  KAKENHI-PROJECT-21300047
[Presentation] 最大クリーク問題の多項式時間的可解性について2011
- Author(s)
  中西裕陽, 富田悦次, 若月光夫, 西野哲朗
- Organizer
  2010年度冬のLAシンポジウム
- Place of Presentation
  京都大学数理解析研究所
- Year and Date
  2011-02-03
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] 最大クリーク問題の多項式時間的可解性の更なる改良結果2011
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] 最大クリーク問題の多項式時間的可解性について2011
- Author(s)
  富田悦次
- Organizer
  JSTERATO湊離散構造処理系プロジェクトセミナー
- Place of Presentation
  北海道大学
- Year and Date
  2011-10-12
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] An improved clique-based method for computing edit distance between rooted unordered trees2011
- Author(s)
  森智弥,田村武幸,深川大路,高須淳宏,富田悦次,阿久津達也
- Organizer
  情報処理学会バイオ情報学研究会
- Place of Presentation
  神戸大学
- Year and Date
  2011-09-13
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 最大クリーク問題の多項式時間的可解性について2011
- Author(s)
  中西裕陽,富田悦次,若月光夫,西野哲朗
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学
- Year and Date
  2011-02-13
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 実時間最終状態受理式決定性限定1カウンタ変換器の多項式時間等価性判定アルゴリズム2011
- Author(s)
  若月光夫, 清野和司, 富田悦次, 西野哲朗
- Organizer
  2010年度冬のLAシンポジウム
- Place of Presentation
  京都大学数理解析研究所420号室
- Year and Date
  2011-02-01
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] 最大クリーク問題の多項式時間的可解性について2011
- Author(s)
  富田悦次
- Organizer
  JST ERATOセミナー
- Place of Presentation
  北海道大学
- Year and Date
  2011-10-12
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 最大クリーク問題の多項式時間的可解性の拡張2011
- Author(s)
  中西裕陽,富田悦次,若月光夫,西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  東北大学
- Year and Date
  2011-10-21
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 最大クリーク問題の多項式時間的可解性の更なる改良結果2011
- Author(s)
  中西裕陽,富田悦次,若月光夫,西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  京都大学
- Year and Date
  2011-04-22
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 変化検出のための極大整合連結集合2011
- Author(s)
  原口誠・大久保好章・富田悦次・吉岡真治
- Organizer
  人工知能学会基本問題研究会
- Place of Presentation
  慶応義塾大学(神奈川県横浜市)
- Year and Date
  2011-12-15
- Data Source
  KAKENHI-PROJECT-21300047
[Presentation] 実時間最終状態受理式決定性限定1カウンタ変換器の多項式時間等価性判定アルゴリズム2011
- Author(s)
  若月光夫, 清野和司, 富田悦次, 西野哲朗
- Organizer
  2010年度冬のLAシンポジウム
- Place of Presentation
  京都大学数理解析研究所
- Year and Date
  2011-02-01
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] 空スタック受理式決定性限定ワンカウンタ変換器の多項式時間等価性判定アルゴリズム2010
- Author(s)
  若月光夫, 清野和司, 富田悦次, 西野哲朗
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学
- Year and Date
  2010-02-02
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク問題の多項式時間的可解性の改良結果2010
- Author(s)
  中西裕陽,富田悦次
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  九州工業大学Kyutechプラザ
- Year and Date
  2010-12-03
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] PLENARY LECTURE, The Maximum Clique Problem2010
- Author(s)
  Etsuji Tomita
- Organizer
  14th WSEAS International Conference on Computers
- Place of Presentation
  Corfu island, Greece(招待講演)
- Year and Date
  2010-07-24
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 最大クリーク抽出の単純な最大時間計算量と多項式時間的可解性2010
- Author(s)
  中西裕陽, 富田悦次, 若月光夫
- Organizer
  冬のLAシンポジウ
- Place of Presentation
  京都大学
- Year and Date
  2010-02-03
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク抽出の単純な最大時間計算量評価と多項式時間的可解性2010
- Author(s)
  中西裕陽, 富田悦次, 若月光夫
- Organizer
  2009年度冬のLAシンポジウム
- Place of Presentation
  京都大学理学研究科北部構内数学教室
- Year and Date
  2010-02-03
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] PLENARY LECTURE, The Maximum Clique Problem2010
- Author(s)
  Etsuji Tomita
- Organizer
  The 14th WSEAS International Conference on Computers
- Place of Presentation
  Corfu Island, Greece 招待講演
- Year and Date
  2010-07-23
- Data Source
  KAKENHI-PROJECT-21300047
[Presentation] 最大クリーク問題の多項式時間的可解性の改良結果2010
- Author(s)
  中西裕陽, 富田悦次
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  九州工業大学Kyutechプラザ, 福岡
- Year and Date
  2010-12-03
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] PLENARY LECTURE, The Maximum Clique Problem2010
- Author(s)
  Etsuji Tomita
- Organizer
  WSEAS International Conference
- Place of Presentation
  Corfu Island, Greece.
- Year and Date
  2010-07-24
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] A simple and faster algorithm for finding a maximum clique2010
- Author(s)
  E. Tomita, Y. Sutani, T. Higashi, S. Takahashi, M. Wakatsuki
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  九州大学
- Year and Date
  2010-01-26
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 空スタック受理式決定性限定ワンカウンタ変換器の多項式時間等価性判定アルゴリズム2010
- Author(s)
  若月光夫, 清野和司, 富田悦次, 西野哲朗
- Organizer
  2009年度冬のLAシンポジウム
- Place of Presentation
  京都大学理学研究科北部構内数学教室
- Year and Date
  2010-02-02
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] 無順序木の編集距離を計算する実用的アルゴリズムについて2010
- Author(s)
  深川大路,田村武幸,高須淳宏,富田悦次,阿久津達也
- Organizer
  人工知能学会人工知能基本問題研究会
- Place of Presentation
  兵庫県立大学
- Year and Date
  2010-08-01
- Data Source
  KAKENHI-PROJECT-22500009
[Presentation] 単純でより高速な最大クリーク抽出アルゴリズム2010
- Author(s)
  富田悦次, 須谷洋一, 東貴紀, 高橋真也, 若月光夫
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  九州大学西新プラザ
- Year and Date
  2010-01-26
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] PLENARY LECTURE, The Maximum Clique Problem (招待講演)2010
- Author(s)
  E. Tomita
- Organizer
  The 14th WSEAS International Conference on Computers
- Place of Presentation
  Corfu Island, Greece
- Year and Date
  2010-07-23
- Data Source
  KAKENHI-PROJECT-21300047
[Presentation] 空スタック受理式決定性限定ワンカウンタ変換器の多項式時間等価性判定アルゴリズム2010
- Author(s)
  若月光夫, 清野和司, 富田悦次, 西野哲朗
- Organizer
  2009年度冬のLAシンポジウム
- Place of Presentation
  京都大学理学研究科北部構内数学教室(理学研究科3号館)127号室
- Year and Date
  2010-02-02
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] A Simple and Faster Algorithm for Finding a Maximum Clique2010
- Author(s)
  E. Tomita, Y. Sutani, T. Higashi, S.Takahashi, M. Wakatsuki
- Organizer
  情報処理学会研究報告アルゴリズム研究会
- Place of Presentation
  九州大学(福岡県福岡市)
- Year and Date
  2010-01-26
- Data Source
  KAKENHI-PROJECT-21300047
[Presentation] 準同型写像によって拡張されたある言語クラスに対する正例からの極限同定2009
- Author(s)
  若月光夫, 富田悦次
- Organizer
  情報処理学会第73回数理モデル化と問題解決研究会
- Place of Presentation
  沖縄科学技術研究基盤機構OIST Seaside House
- Year and Date
  2009-03-05
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] 最大クリーク抽出アルゴリズムの並列処理による高速化2009
- Author(s)
  富田悦次
- Organizer
  SCOPE研究会
- Place of Presentation
  大阪学院大学
- Year and Date
  2009-05-30
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 準同型写像によって拡張されたある言語クラスに対する正例からの極限同定2009
- Author(s)
  若月光夫, 富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  沖縄科学技術研究基盤機構OIST Seaside House.
- Year and Date
  2009-03-05
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] 準同型写像によって拡張されたある言語クラスに対する正例からの極限同定2009
- Author(s)
  若月光夫, 富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  沖縄科学技術研究基盤機構
- Year and Date
  2009-03-05
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] Polynomial-time solvability of the maximum clique problem2009
- Author(s)
  E. Tomita, H. Nakanishi
- Organizer
  Proc. European Computing Conference 2009
- Place of Presentation
  Tbilisi, Georgia
- Year and Date
  2009-06-26
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク抽出の単純な最大時間計算量評価2009
- Author(s)
  中西裕陽, 富田悦次, 若月光夫
- Organizer
  夏のLAシンポジウム
- Place of Presentation
  かんぽの宿松島
- Year and Date
  2009-07-22
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] Polynomial-time solvability of the maximum clique problem2009
- Author(s)
  富田悦次
- Organizer
  European Computing Conference 2009
- Place of Presentation
  Tbilisi, Georgia
- Year and Date
  2009-06-26
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 組合せ最適化問題の新展開-最大クリーク抽出問題の高速化とその応用-2009
- Author(s)
  富田悦次
- Organizer
  緊急地震速報システムの利活用研究会
- Place of Presentation
  晴海トリトンスクウェア
- Year and Date
  2009-03-27
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク抽出問題の理論計算量評価について-グラフの次数を限定した場合2008
- Author(s)
  中西裕陽, 富田悦次
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  名古屋工業大学
- Year and Date
  2008-09-12
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク抽出アルゴリズムの共有メモリ型並列計算機上での並列化2008
- Author(s)
  若月光夫, 高橋真也, 富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  電気通信大学
- Year and Date
  2008-09-18
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク抽出問題の理論計算量評価について-多項式時間計算機量の場合2008
- Author(s)
  中西裕陽, 富田悦次
- Organizer
  夏のLAシンポジウム
- Place of Presentation
  南紀勝浦国民休暇村
- Year and Date
  2008-07-23
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリークを抽出する時間計算量O (20. 1912n)の多項式領域アルゴリズム2008
- Author(s)
  中西裕陽, 富田悦次
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  法政大学
- Year and Date
  2008-01-23
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク抽出問題とその応用2008
- Author(s)
  富田悦次
- Organizer
  北海道大学大学院情報科学研究科コンピュータサイエンス専攻離散構造とアルゴリズム研究会
- Place of Presentation
  千歳市支笏湖丸駒温泉
- Year and Date
  2008-08-28
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク抽出アルゴリズムの共有メモリ型並列計算機上での並列化2008
- Author(s)
  若月光夫, 高橋真也, 富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  電気通信大学
- Year and Date
  2008-09-18
- Data Source
  KAKENHI-PROJECT-20500007
[Presentation] Polynomial-time solvability of the maximum clique problem2008
- Author(s)
  富田悦次
- Organizer
  SCOPE研究会
- Place of Presentation
  大阪学院大学
- Year and Date
  2008-11-02
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] NP完全問題の計算量評価・改善について-最大クリーク問題を中心として-2008
- Author(s)
  富田悦次
- Organizer
  SCOPE研究会
- Place of Presentation
  中央大学
- Year and Date
  2008-07-20
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリーク抽出問題とその応用2008
- Author(s)
  富田悦次
- Organizer
  北海道大学大学院情報科学研究科コンピュータサイエンス専攻離散構造とアルゴリズム研究会
- Place of Presentation
  千歳市支笏湖丸駒温泉
- Year and Date
  2008-08-28
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 極大クリーク全列挙アルゴリズムを用いた企業コミュニティ理解2007
- Author(s)
  米森力, 松永務, 富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会/バイオ情報学研究会
- Place of Presentation
  産総研生命情報工学研究センター
- Year and Date
  2007-12-20
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] The maximum clique problem and its applications (Invited Lecture)2007
- Author(s)
  Etsuji Tomita
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  産業総合技術研究所生命情報工学研究センター
- Year and Date
  2007-12-20
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリークを抽出する単純なアルゴリズムの最大次数4のグラフにおける計算量2007
- Author(s)
  中西裕陽, 富田悦次
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  北海道大学
- Year and Date
  2007-06-29
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] Advanced algorithms and their applications2007
- Author(s)
  Etsuji Tomita
- Organizer
  Advanced Information and Communication Technology
- Place of Presentation
  Beijing University of Posts and Telecommunications
- Year and Date
  2007-09-20
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] NetMCQ: A distributed exact maximum clique so lver2007
- Author(s)
  S. Urabe, E. Tomita
- Organizer
  情報処理学会数理モデル化と問題解決研究会/バイオ情報学研究会
- Place of Presentation
  産総研生命情報工学研究センター
- Year and Date
  2007-12-20
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] Polynomial time identification of finite state transducers in some class2007
- Author(s)
  M. Wakatsuki, E. Tomita
- Organizer
  Advanced Information and Communication Technology
- Place of Presentation
  Beijing, China
- Year and Date
  2007-09-20
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリークを抽出する時間計算量O(20. 2495n)の多項式領域アルゴリズム2007
- Author(s)
  中西裕陽, 富田悦次
- Place of Presentation
  東北大学
- Year and Date
  2007-10-29
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] Advanced algorithms and their applications2007
- Author(s)
  E. Tomita
- Organizer
  Advanced Information and Communication Technology
- Place of Presentation
  Beijing, China
- Year and Date
  2007-09-20
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 理論評価付き最大クリーク抽出アルゴリズムの実験的評価2007
- Author(s)
  玉田和洋, 富田悦次, 中西裕陽
- Organizer
  情報処理学会数理モデル化と問題解決研究会/バイオ情報学研究会
- Place of Presentation
  産総研生命情報工学研究センター
- Year and Date
  2007-12-20
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] ハイパーグラフを対象とした最大クリーク抽出の分枝限定アルゴリズム2007
- Author(s)
  須谷洋一*, 富田悦次, 小林聡
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  名古屋大学(*情報処理学会山下記念研究賞受賞)
- Year and Date
  2007-09-04
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] The maximum clique pro blem and its applications (Invited Le cture)2007
- Author(s)
  E. Tomita
- Organizer
  情報処理学会数理モデル化と問題解決研究会/バイオ情報学研究会
- Place of Presentation
  産総研生命情報工学研究センター
- Year and Date
  2007-12-20
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] 最大クリークを抽出する時間計算量O(20. 19669n)の多項式領域アルゴリズム2007
- Author(s)
  中西裕陽, 富田悦次
- Place of Presentation
  新潟大学
- Year and Date
  2007-11-30
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] A more efficient algorithm for finding a maximum clique with an improved approximate coloring2007
- Author(s)
  E. Tomita, Y. Sutani, T. Higashi
- Organizer
  Proc. PDPTA
- Place of Presentation
  Las Vegas, USA.
- Year and Date
  2007-06-25
- Data Source
  KAKENHI-PROJECT-19500010
[Presentation] j-核性を持つ極大疑似クリークの全列挙
- Author(s)
  ジェイ泓杰,原口誠, 大久保好章，富田悦次
- Organizer
  情報科学技術フォーラム（FIT 2014）
- Place of Presentation
  筑波大学
- Year and Date
  2014-09-03 – 2014-09-05
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 最大クリーク問題の多項式時間的可解性の拡張の更なる改良
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会/情報処理学会アルゴリズム研究会
- Place of Presentation
  道後温泉大和屋（愛媛県松山市）
- Year and Date
  2014-06-13 – 2014-06-14
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] 極大(j,k)疑似クリークの全列挙に関する一考察
- Author(s)
  松平将宜,原口誠,大久保好章，富田悦次
- Organizer
  人工知能学会全国大会
- Place of Presentation
  ひめぎんホール（愛媛県県民文化会館）
- Year and Date
  2014-05-12 – 2014-05-15
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 誘導グラフの次数下限制約に基づく疑似クリークの列挙法
- Author(s)
  ジェイ泓杰，原口誠, 大久保好章，富田悦次
- Organizer
  情報処理学会数理モデル化と問題解決研究会
- Place of Presentation
  日本科学未来館
- Year and Date
  2014-09-25 – 2014-09-26
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 最大クリーク問題の多項式時間的可解性の拡張の改良
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  法政大学小金井キャンパス梶野町校舎西館W203
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] 実時間決定性限定1カウンタ変換器に対する質問による多項式時間学習アルゴリズム
- Author(s)
  若月光夫，富田悦次，西野哲朗
- Organizer
  2013年度冬のLAシンポジウム
- Place of Presentation
  京都大学数理解析研究所 420号室
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] A polynomial-time algorithm for checking the inclusion of deterministic restricted one-counter transducers which accept by final state
- Author(s)
  Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino
- Organizer
  30th International Conference on Computers and Their Applications
- Place of Presentation
  Waikiki Beach Marriott Resort & Spa, Honolulu, Hawaii, U.S.A.
- Year and Date
  2015-03-09 – 2015-03-11
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] 決定性限定1カウンタ変換器のある部分クラスに対する質問による多項式時間学習アルゴリズム
- Author(s)
  若月光夫，富田悦次，西野哲朗
- Organizer
  2012年度冬のLAシンポジウム
- Place of Presentation
  京都大学数理解析研究所 420号室
- Data Source
  KAKENHI-PROJECT-23500011
[Presentation] 疑似クリーク制約を用いたクリーク族の全列挙
- Author(s)
  ジェイ泓杰, 原口誠, 大久保好章，富田悦次
- Organizer
  人工知能学会人工知能基本問題研究会
- Place of Presentation
  名古屋工業大学
- Year and Date
  2015-01-13 – 2015-01-14
- Data Source
  KAKENHI-PROJECT-25330009
[Presentation] 最大クリーク問題の多項式時間的可解性の拡張の更なる改良
- Author(s)
  中西裕陽，富田悦次，若月光夫，西野哲朗
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  道後温泉大和屋
- Year and Date
  2014-06-13 – 2014-06-14
- Data Source
  KAKENHI-PROJECT-25330009

1. TAKAHASHI Haruhisa (90135418)

# of Collaborated Projects: 11 results

# of Collaborated Products: 4 results
2. NISHINO Tetsuro (10198484)

# of Collaborated Projects: 11 results

# of Collaborated Products: 49 results
3. WAKATSUKI Mitsuo (30251705)

# of Collaborated Projects: 11 results

# of Collaborated Products: 82 results
4. KASAI Takumi (70027382)

# of Collaborated Projects: 4 results

# of Collaborated Products: 0 results
5. MACHIDA Hajime (40090534)

# of Collaborated Projects: 3 results

# of Collaborated Products: 0 results
6. TAKEDA Mitsuo (00114926)

# of Collaborated Projects: 3 results

# of Collaborated Products: 0 results
7. MAKOTO Haraguchi (40128450)

# of Collaborated Projects: 2 results

# of Collaborated Products: 4 results
8. YOSHIAKI Okubo (40271639)

# of Collaborated Projects: 2 results

# of Collaborated Products: 8 results
9. TARUI Jun (00260539)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
10. KOBAYASHI Satoshi (50251707)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
11. 伊藤大雄 (50283487)

# of Collaborated Projects: 2 results

# of Collaborated Products: 11 results
12. KIMIHITO Ito (60396314)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
13. MASAHARU Yoshioka (40290879)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
14. OKANOYA Kazuo (30211121)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
15. TANAKA Shigeru (70281706)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
16. YAMAZAKI Tadashi (40392162)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
17. YOKOMORI Takashi (60139722)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
18. YOSHIDA Toshinobu (30114341)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
19. HOTTA Kazuhiro (40345426)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
20. NOSHITA Kohei (60011706)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results

ETSUJI Tomita 富田 悦次

TOMITA Etsuji 富田 悦次

Research Projects

Research Products

Co-Researchers

効率的な最大および極大クリーク抽出アルゴリズムの開発と応用Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Much faster algorithms for finding maximum and maximal cliques and their applicationsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development of efficient algorithms for finding a maximum clique with theoretical and experimental evaluations and their applicationsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Improvement and extension of maximum-clique-finding algorithms with complexity analysis and their applicationsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Developments of Efficient Combinatorial Algorithms and Their ApplicationsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Studies on Efficient Learning Algorithms from ExamplesPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development and Applications of Efficient Algorithms for Combinatorial Optimization ProblemsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

ETSUJI Tomita 富田悦次

TOMITA Etsuji 富田悦次