Minimum Bisection Is NP-hard on Unit Disk Graphs (Q2922613)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum Bisection Is NP-hard on Unit Disk Graphs |
scientific article |
Statements
Minimum Bisection Is NP-hard on Unit Disk Graphs (English)
0 references
14 October 2014
0 references
minimum bisection problem
0 references
unit disk graphs
0 references
planar graphs
0 references
NP-hardness
0 references
