NP-completeness of minimum spanner problems (Q1315465)
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-completeness of minimum spanner problems |
scientific article; zbMATH DE number 513347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of minimum spanner problems |
scientific article; zbMATH DE number 513347 |
Statements
NP-completeness of minimum spanner problems (English)
0 references
10 March 1994
0 references
spanning subgraph
0 references
NP-complete
0 references
digraphs
0 references
oriented graphs
0 references
0 references
0.89608675
0 references
0.89399636
0 references
0.88995516
0 references
0.8894883
0 references
0.8832229
0 references
