Pages that link to "Item:Q2304552"
From MaRDI portal
The following pages link to Approximation algorithms for connected maximum cut and related problems (Q2304552):
Displaying 12 items.
- 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)
- Approximating max-cut under graph-MSO constraints (Q2294245) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- (Q3452832) (redirect page) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- On the bond polytope (Q6060889) (← links)
- Counting connected partitions of graphs (Q6606326) (← links)
