The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:58, 5 March 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
