Minimum Bisection Is NP-hard on Unit Disk Graphs (Q2922613): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q314817 |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Josep Diaz / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963515234 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1404.0117 / rank | |||
Normal rank | |||
Latest revision as of 10:53, 19 April 2024
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
