The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SteinLib / rank | |||
Normal rank | |||
Revision as of 05:27, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The dynamic predicate stashing copy problem and the Steiner problem in graphs |
scientific article |
Statements
The dynamic predicate stashing copy problem and the Steiner problem in graphs (English)
0 references
3 September 2001
0 references
network programming
0 references
communication
0 references
Steiner problem in graphs
0 references
