Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values (Q2455841): 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.1080/10020070612330048 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W204473615 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values |
scientific article |
Statements
Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values (English)
0 references
26 October 2007
0 references
minimum spanning tree
0 references
shortest-path problem
0 references
inverse problem
0 references
reverse problem
0 references
computational complexity
0 references
