Pages that link to "Item:Q5232324"
From MaRDI portal
The following pages link to A General Framework for Graph Sparsification (Q5232324):
Displaying 11 items.
- Sparsity. Graphs, structures, and algorithms (Q419416) (← links)
- Learning to sparsify travelling salesman problem instances (Q2117244) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- (Q4230327) (← links)
- Drawing Big Graphs Using Spectral Sparsification (Q4625115) (← links)
- Fine-grained complexity for sparse graphs (Q5230293) (← links)
- A Generic Framework for Engineering Graph Canonization Algorithms (Q5232733) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Multi-priority graph sparsification (Q6182885) (← links)
- Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows (Q6593766) (← links)