NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem |
scientific article; zbMATH DE number 5083147
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem |
scientific article; zbMATH DE number 5083147 |
Statements
NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (English)
0 references
9 January 2007
0 references
vertex ranking
0 references
spanning tree
0 references
graph theory
0 references
NP-hard
0 references
computational complexity
0 references
approximation algorithm
0 references
