On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941): 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.tcs.2011.09.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034112762 / rank | |||
Normal rank | |||
Revision as of 02:07, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing the minimum 3-path vertex cover and dissociation number of graphs |
scientific article |
Statements
On computing the minimum 3-path vertex cover and dissociation number of graphs (English)
0 references
7 December 2011
0 references
path vertex cover
0 references
dissociation number
0 references
approximation
0 references
