Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746)
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: Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm |
scientific article; zbMATH DE number 1091308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm |
scientific article; zbMATH DE number 1091308 |
Statements
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (English)
0 references
25 November 1997
0 references
dynamic tree
0 references
parallel graph algorithms
0 references
Euler tours
0 references
network simplex
0 references
0 references
0 references
0 references
0.90560323
0 references
0.8565974
0 references
0.8535672
0 references
0.8529289
0 references
0.8529289
0 references
