A complete characterization of the path layout construction problem for ATM networks with given hop count and load (Q4571983): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4733694 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Routing with Polynomial Communication-Space Trade-Off / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5624995 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3883524 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3292914 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal layouts on a chain ATM network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The virtual path layout problem in fast networks (extended abstract) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4293108 / rank | |||
Normal rank | |||
Latest revision as of 02:30, 16 July 2024
scientific article; zbMATH DE number 6898406
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete characterization of the path layout construction problem for ATM networks with given hop count and load |
scientific article; zbMATH DE number 6898406 |
Statements
A complete characterization of the path layout construction problem for ATM networks with given hop count and load (English)
0 references
4 July 2018
0 references
