Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length (Q1619461): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: 2SI2R rumor spreading model in homogeneous networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2747613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Emergence of Scaling in Random Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transport optimization on complex networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Routing in a Packet-Switched Computer Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding good approximate vertex and edge partitions is NP-hard / rank | |||
Normal rank | |||
Revision as of 08:31, 17 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length |
scientific article |
Statements
Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length (English)
0 references
13 November 2018
0 references
biased-shortest path
0 references
linear-prediction
0 references
congestion
0 references
networks
0 references
