Pages that link to "Item:Q2938098"
From MaRDI portal
The following pages link to Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098):
Displaying 7 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (Q2301754) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Largest Chordal and Interval Subgraphs Faster Than 2 n (Q2849310) (← links)
- Linear-Time Generation of Random Chordal Graphs (Q5283388) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
