Distributed algorithms for planar networks. II: Low-congestion shortcuts, MST, and Min-Cut (Q4575592)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Distributed algorithms for planar networks. II: Low-congestion shortcuts, MST, and Min-Cut |
scientific article; zbMATH DE number 6903893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed algorithms for planar networks. II: Low-congestion shortcuts, MST, and Min-Cut |
scientific article; zbMATH DE number 6903893 |
Statements
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut (English)
0 references
16 July 2018
0 references
0.8759306073188782
0 references
0.8559243679046631
0 references
0.8466642498970032
0 references
0.8391121029853821
0 references
0.8352890610694885
0 references
