Finding good approximate vertex and edge partitions is NP-hard (Q1198051): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:42, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding good approximate vertex and edge partitions is NP-hard |
scientific article |
Statements
Finding good approximate vertex and edge partitions is NP-hard (English)
0 references
16 January 1993
0 references
graph partitioning
0 references
approximation algorithm
0 references
NP-hard
0 references
separators
0 references
