Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs (Q5363764)
From MaRDI portal
scientific article; zbMATH DE number 6784962
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs |
scientific article; zbMATH DE number 6784962 |
Statements
29 September 2017
0 references
fixed-parameter algorithm
0 references
preprocessing
0 references
data reduction
0 references
polynomial-time algorithm
0 references
longest path problem
0 references
interval graphs
0 references
proper interval vertex deletion set
0 references
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs (English)
0 references
