Faster exact algorithms for steiner trees in planar networks (Q4206584): 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.1002/net.3230200110 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031493401 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Revision as of 11:54, 20 June 2024
scientific article; zbMATH DE number 4127030
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster exact algorithms for steiner trees in planar networks |
scientific article; zbMATH DE number 4127030 |
Statements
Faster exact algorithms for steiner trees in planar networks (English)
0 references
1990
0 references
optimal Steiner tree
0 references
planar networks
0 references
