Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530): 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.1007/s10878-005-5486-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044926776 / rank | |||
Normal rank | |||
Revision as of 21:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weighted inverse minimum spanning tree problems under Hamming distance |
scientific article |
Statements
Weighted inverse minimum spanning tree problems under Hamming distance (English)
0 references
17 May 2005
0 references
minimum spanning tree
0 references
inverse problem
0 references
strongly polynomial algorithm
0 references
