Pages that link to "Item:Q4009810"
From MaRDI portal
The following pages link to The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810):
Displaying 6 items.
- Finding optimal subgraphs by local search (Q1392027) (← links)
- Sequential and parallel solution-biased search for subgraph algorithms (Q2327237) (← links)
- Parallel Complexity of the Connected Subgraph Problem (Q4202213) (← links)
- (Q4290645) (← links)
- Tight Bounds for the Maximum Acyclic Subgraph Problem (Q4366872) (← links)
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation (Q5236200) (← links)