Pages that link to "Item:Q2343085"
From MaRDI portal
The following pages link to Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085):
Displayed 6 items.
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- (Q5136332) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)