On cutting a few vertices from a graph (Q1811082)
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 1925264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On cutting a few vertices from a graph |
scientific article; zbMATH DE number 1925264 |
Statements
On cutting a few vertices from a graph (English)
0 references
10 June 2003
0 references
approximation algorithms
0 references
graph partitioning
0 references
random edge contraction
0 references
dynamic programming
0 references
0.8325759768486023
0 references
0.8315039873123169
0 references
0.8288131952285767
0 references
0.827459990978241
0 references
