Minimum bisection is NP-hard on unit disk graphs (Q2407090)
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
28 September 2017
0 references
minimum bisection problem
0 references
unit disk graphs
0 references
planar graphs
0 references
NP-hardness
0 references
0 references
