Pages that link to "Item:Q391973"
From MaRDI portal
The following pages link to Maximum balanced subgraph problem parameterized above lower bound (Q391973):
Displaying 9 items.
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- A matheuristic approach for the maximum balanced subgraph of a signed graph (Q5034728) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
