Pages that link to "Item:Q2258069"
From MaRDI portal
The following pages link to Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069):
Displaying 6 items.
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Learning chordal extensions (Q2046324) (← links)
- On the generalized AOR and CG iteration methods for a class of block two-by-two linear systems (Q2138401) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2911621) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)