A note on the computational complexity of graph vertex partition (Q868398)
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 5130480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the computational complexity of graph vertex partition |
scientific article; zbMATH DE number 5130480 |
Statements
A note on the computational complexity of graph vertex partition (English)
0 references
2 March 2007
0 references
graph partition
0 references
stable set
0 references
deficiency number
0 references
polynomial algorithm
0 references
Xuong tree
0 references
0 references
0 references
0.831006646156311
0 references
0.7924366593360901
0 references
0.7877086997032166
0 references
0.7789939045906067
0 references
