A New Formulation for Spanning Trees (Q2840708): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2011.05.034 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048262212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matroids and the greedy algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank | |||
Normal rank | |||
Latest revision as of 16:27, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Formulation for Spanning Trees |
scientific article |
Statements
A New Formulation for Spanning Trees (English)
0 references
23 July 2013
0 references
spanning trees
0 references
integer programing
0 references
