Minimum cost \(\leq k\) edges connected subgraph problems (Q2883545)
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: Minimum cost k edges connected subgraph problems |
scientific article; zbMATH DE number 6033903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost \(\leq k\) edges connected subgraph problems |
scientific article; zbMATH DE number 6033903 |
Statements
13 May 2012
0 references
network models
0 references
isomorphic graph
0 references
matching
0 references
0 references
Minimum cost \(\leq k\) edges connected subgraph problems (English)
0 references
0.7980518937110901
0 references
0.7965343594551086
0 references
0.7939689755439758
0 references
0.7920936942100525
0 references
