Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324)
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: Finding Totally Independent Spanning Trees with Linear Integer Programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Totally Independent Spanning Trees with Linear Integer Programming |
scientific article |
Statements
Finding Totally Independent Spanning Trees with Linear Integer Programming (English)
0 references
16 October 2015
0 references
combinatorial optimization
0 references
totally independent spanning trees
0 references
packing connected dominating sets
0 references
branch-and-cut algorithms
0 references
0 references
0 references
0 references
0 references
0 references
