A heuristic algorithm for the mini-max spanning forest problem (Q1278250): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)00335-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973984239 / rank | |||
Normal rank | |||
Revision as of 01:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic algorithm for the mini-max spanning forest problem |
scientific article |
Statements
A heuristic algorithm for the mini-max spanning forest problem (English)
0 references
27 April 1999
0 references
spanning forest
0 references
mini-max problem
0 references
heuristics
0 references
graph theory
0 references
