Pages that link to "Item:Q441861"
From MaRDI portal
The following pages link to \textsc{max-cut} and containment relations in graphs (Q441861):
Displaying 7 items.
- Seminormality, canonical modules, and regularity of cut polytopes (Q1979324) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
