Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q5363764)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6784962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9970523715019226
0 references
0.8425071239471436
0 references
0.8254641890525818
0 references
0.7784852385520935
0 references
0.7751553058624268
0 references
