An algorithm to find a minimum feedback vertex set of an interval graph (Q3539484)
From MaRDI portal
 | 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: An algorithm to find a minimum feedback vertex set of an interval graph |
scientific article; zbMATH DE number 5368428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm to find a minimum feedback vertex set of an interval graph |
scientific article; zbMATH DE number 5368428 |
Statements
18 November 2008
0 references
design and analysis of algorithms
0 references
network flow
0 references
0.8786433339118958
0 references
0.837632417678833
0 references
0.8356627225875854
0 references
0.8353049755096436
0 references
0.8347686529159546
0 references
