Parallelism and the feedback vertex set problem (Q1111395): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4128417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4146249 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Feedback vertex sets and cyclically reducible graphs / rank | |||
Normal rank | |||
Latest revision as of 10:58, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallelism and the feedback vertex set problem |
scientific article |
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
