Pages that link to "Item:Q2875132"
From MaRDI portal
The following pages link to Subgraph sparsification and nearly optimal ultrasparsifiers (Q2875132):
Displaying 10 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Extracting a basis with fixed block inside a matrix (Q486196) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
- A Local Search Framework for Experimental Design (Q5092507) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- (Q5874542) (← links)
- Advances in metric embedding theory (Q5894374) (← links)