The fractional congestion bound for efficient edge disjoint routing (Q3507649): 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.20216 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4240665466 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-disjoint paths in Planar graphs with constant congestion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4542572 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4856179 / rank | |||
Normal rank |
Latest revision as of 12:25, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The fractional congestion bound for efficient edge disjoint routing |
scientific article |
Statements
The fractional congestion bound for efficient edge disjoint routing (English)
0 references
20 June 2008
0 references
disjoint paths
0 references
routing
0 references
multicommodity flow
0 references
randomized algorithms
0 references
rounding
0 references