Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656)
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: Critical edges/nodes for the minimum spanning tree problem: complexity and approximation |
scientific article; zbMATH DE number 6197003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Critical edges/nodes for the minimum spanning tree problem: complexity and approximation |
scientific article; zbMATH DE number 6197003 |
Statements
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (English)
0 references
9 August 2013
0 references
most vital edges/nodes
0 references
min edge/node blocker
0 references
minimum spanning tree
0 references
complexity
0 references
approximation
0 references
0 references
0 references
0 references
