Pages that link to "Item:Q1111395"
From MaRDI portal
The following pages link to Parallelism and the feedback vertex set problem (Q1111395):
Displaying 7 items.
- On the feedback vertex set problem for a planar graph (Q678111) (← links)
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) (← links)
- On locating minimum feedback vertex sets (Q1113681) (← links)
- Parallel Algorithms for Reducible Flow Graphs (Q3128985) (← links)
- On the complexity of feedback set problems in signed digraphs (Q3503560) (← links)
- Feedback vertex sets and cyclically reducible graphs (Q3771642) (← links)
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810) (← links)