Pages that link to "Item:Q1386369"
From MaRDI portal
The following pages link to Parallel algorithms for maximal acyclic sets (Q1386369):
Displaying 9 items.
- A parallel algorithm for eliminating cycles in undirected graphs (Q910243) (← links)
- Parallelism and the maximal path problem (Q1098641) (← links)
- A randomized NC algorithm for the maximal tree cover problem (Q1183479) (← links)
- Parallel complexity of computing a maximal set of disjoint paths (Q1186594) (← links)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. (Q1853125) (← links)
- Parallel complexity of partitioning a planar graph into vertex-induced forests (Q1923610) (← links)
- (Q3795217) (← links)
- Parallel algorithms for evaluating sequences of set-manipulation operations (Q4327628) (← links)
- (Q4723312) (← links)