The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing
From MaRDI portal
Recommendations
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- Alternative parameterizations for cluster editing
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- Going Weighted: Parameterized Algorithms for Cluster Editing
Cited in
(10)- A new temporal interpretation of cluster editing
- Cluster editing for multi-layer and temporal graphs
- PACE solver description: the PACE 2023 parameterized algorithms and computational experiments challenge: twinwidth
- Graph clustering problems under the Lens of parameterized local search
- The PACE 2022 parameterized algorithms and computational experiments challenge: directed feedback vertex set
- Applying a cut-based data reduction rule for weighted cluster editing in polynomial time
- Graph clustering problems under the Lens of parameterized local search
- The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization
- Designing compact ILPs via fast witness verification
- The PACE 2025 parameterized algorithms and computational experiments challenge: dominating set and hitting set
This page was built for publication: The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192494)