Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760)
From MaRDI portal
(Redirected from Item:Q5915971)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs |
scientific article; zbMATH DE number 7040836
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs |
scientific article; zbMATH DE number 7040836 |
Statements
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (English)
0 references
22 November 2017
0 references
22 March 2019
0 references
subset feedback vertex set
0 references
graph algorithms
0 references
interval graphs
0 references
permutation graphs
0 references
0 references
0 references
1.0000006
0 references
0.91757137
0 references
0.91698784
0 references
0.91564816
0 references
0.9043502
0 references
0.8984957
0 references
0.8975849
0 references
0 references
0.89337885
0 references
0 references
