Finding good approximate vertex and edge partitions is NP-hard (Q1198051): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Partitioning Planar Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Separator Theorem for Planar Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Heuristic Algorithm for Small Separators in Arbitrary Graphs / rank | |||
Normal rank | |||
Latest revision as of 14:35, 16 May 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
