The following pages link to Max-Cut Under Graph Constraints (Q3186491):
Displaying 16 items.
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- Maximum cutwidth problem for graphs. (Q1413710) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- Hardness of Graph Pricing Through Generalized Max-Dicut (Q2941530) (← links)
- (Q4937814) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- A maximum dicut in a digraph induced by a minimal dominating set (Q5090164) (← links)
- (Q5875545) (← links)
- Complexity of the max cut problem with the minimal domination constraint (Q5878608) (← links)
- Counting connected partitions of graphs (Q6606326) (← links)
