Pages that link to "Item:Q652537"
From MaRDI portal
The following pages link to Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537):
Displaying 16 items.
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- The necessary and sufficient condition and the efficient algorithms for gradually varied fill (Q749234) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Searching for better fill-in (Q2453556) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Searching for better fill-in (Q2957867) (← links)
- Faster Parameterized Algorithms for Minimum Fill-In (Q3596726) (← links)
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering (Q3642841) (← links)
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds (Q4575794) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- (Q5111890) (← links)
- Subexponential Parameterized Algorithm for Minimum Fill-In (Q5408764) (← links)
- (Q5743514) (← links)
- (Q5874519) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)