Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2020/10/01 Vol. E103-ANo. 10 ;
pp. 1193-1201 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: complexity theory Keyword: Maximum k-path vertex cover, NP-hardness, polynomial time algorithm, split graphs, bounded treewidth,