Parallelism and the feedback vertex set problem (Q1111395)
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 4076650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallelism and the feedback vertex set problem |
scientific article; zbMATH DE number 4076650 |
Statements
Parallelism and the feedback vertex set problem (English)
0 references
1988
0 references
The feedback vertex set problem consists of finding in a digraph \(G=(N,E)\) a minimum set of vertices such that each cycle in G includes at least a vertex of such a set. It is shown that this problem is logspace- complete for P when G is cyclically reducible. A parallel algorithm requiring O(k \(log^ 2 n)\) time and \(O(n^ 4)\) processors is presented, where k denotes the cardinality of the minimum feedback vertex set.
0 references
logspace-complete
0 references
parallel algorithm
0 references
minimum feedback vertex set
0 references
0.8549414873123169
0 references
0.8293734192848206
0 references
0.8285285234451294
0 references
