Submodular potential function for the minimum color spanning tree problem of edge-colored graphs (Q3403696)
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: Submodular potential function for the minimum color spanning tree problem of edge-colored graphs |
scientific article; zbMATH DE number 5670542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Submodular potential function for the minimum color spanning tree problem of edge-colored graphs |
scientific article; zbMATH DE number 5670542 |
Statements
12 February 2010
0 references
edge-colored graph
0 references
minimum color spanning tree
0 references
maximum color matching
0 references
0.8153151869773865
0 references
0.8036393523216248
0 references
0.7943005561828613
0 references
0.7883943915367126
0 references
