A note on the computational complexity of graph vertex partition (Q868398): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.06.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058728300 / rank | |||
Normal rank | |||
Revision as of 23:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the computational complexity of graph vertex partition |
scientific article |
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
