Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs

标题
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs
作者
关键词
Polynomial-time algorithm, Longest path problem, Interval graphs, Proper interval vertex deletion set, Data reduction, Fixed-parameter algorithm
出版物
THEORETICAL COMPUTER SCIENCE
Volume 689, Issue -, Pages 67-95
出版商
Elsevier BV
发表日期
2017-05-26
DOI
10.1016/j.tcs.2017.05.017

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started