Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs (Q1920227)
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: Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs |
scientific article; zbMATH DE number 918712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs |
scientific article; zbMATH DE number 918712 |
Statements
Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs (English)
0 references
19 June 1997
0 references
Polynomial-time algorithms for the feedback vertex set problem in cocomparability graphs and complex bipartite graphs are presented.
0 references
polynomial-time algorithms
0 references
feedback vertex set
0 references
cocomparability graphs
0 references
complex bipartite graphs
0 references
