Pages that link to "Item:Q4575794"
From MaRDI portal
The following pages link to Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds (Q4575794):
Displaying 9 items.
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering (Q3642841) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- (Q5743514) (← links)