Takeaki UNO


Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four
Kazuhiro KURITA Kunihiro WASA Takeaki UNO Hiroki ARIMURA 
Publication:   
Publication Date: 2018/09/01
Vol. E101-A  No. 9  pp. 1383-1391
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
enumeration algorithminduced subgraphinduced matchingconstant amortized time enumeration
 Summary | Full Text:PDF(1.3MB)

Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree
Kunihiro WASA Yusaku KANETA Takeaki UNO Hiroki ARIMURA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2014/03/01
Vol. E97-D  No. 3  pp. 421-430
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science —New Trends in Theory of Computation and Algorithm—)
Category: Graph Algorithms, Knowledge Discovery
Keyword: 
graph algorithmenumeration algorithmconstant delay enumerationmotif discoverytree mining
 Summary | Full Text:PDF(561.3KB)

Generating Chordal Graphs Included in Given Graphs
Masashi KIYOMI Takeaki UNO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/02/01
Vol. E89-D  No. 2  pp. 763-770
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Graph Algorithm
Keyword: 
chordal graphenumerationconstant time
 Summary | Full Text:PDF(262.4KB)