Pages that link to "Item:Q260267"
From MaRDI portal
The following pages link to Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267):
Displaying 4 items.
- Well-partitioned chordal graphs (Q2144581) (← links)
- An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (Q2301754) (← links)
- Largest Chordal and Interval Subgraphs Faster Than 2 n (Q2849310) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)