Kazuhiro KURITA


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)