Minimum bisection is NP-hard on unit disk graphs (Q2407090)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6782876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum bisection is NP-hard on unit disk graphs |
scientific article; zbMATH DE number 6782876 |
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
0.9999999
0 references
0.9290505
0 references
0.8828004
0 references
0.8687067
0 references
0.8650328
0 references
0.8638852
0 references
0 references
0.85981387
0 references
0.85939586
0 references
