Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs (Q2942437): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_46 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W587362032 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:34, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs |
scientific article |
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
