On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:50, 30 January 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
