Integer programming formulations for minimum spanning forests and connected components in sparse graphs (Q2942437)
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: Integer programming formulations for minimum spanning forests and connected components in sparse graphs |
scientific article; zbMATH DE number 6480675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integer programming formulations for minimum spanning forests and connected components in sparse graphs |
scientific article; zbMATH DE number 6480675 |
Statements
Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs (English)
0 references
11 September 2015
0 references
minimum spanning forest
0 references
minimum spanning tree
0 references
connected components
0 references
network vulnerability analysis
0 references
integer programming
0 references
0.7864225506782532
0 references
0.7790178060531616
0 references
0.7595400214195251
0 references
0.7567183971405029
0 references
