Results overview: Found 1 records in 0.02 seconds.
Articles, 1 records found
Articles 1 records found  
1.
9 p, 549.8 KB Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm / Tarjan, Robert E.
The dynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges (linking) and splitting by deleting edges (cutting), while at the same time allowing reporting of certain combinations of vertex or edge values. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 169-177  
 UAB restricted access

Interested in being notified about new results for this query?
Set up a personal email alert or subscribe to the RSS feed.