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 5 items.
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- Dilation coefficient, plane-width, and resolution coefficient of graphs (Q1950340) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)