Maximum Balanced Subgraph Problem Parameterized above Lower Bound
From MaRDI portal
Publication:4925260
DOI10.1007/978-3-642-38768-5_39zbMath1382.68102arXiv1212.6848OpenAlexW2570457167MaRDI QIDQ4925260
No author found.
Publication date: 11 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.6848
Related Items
Satisfying more than half of a system of linear equations over GF(2): a multivariate approach, Balanced Judicious Bipartition is Fixed-Parameter Tractable, \textsc{Max-Cut} parameterized above the Edwards-Erdős bound