Pages that link to "Item:Q884483"
From MaRDI portal
The following pages link to MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483):
Displayed 14 items.
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
- Dilation coefficient, plane-width, and resolution coefficient of graphs (Q1950340) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- Balanced polychromatic 2-coloring of triangulations (Q2062902) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)