Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm |
scientific article |
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
