"Dynamic trees as search trees via Euler tours, applied to the network ..."

Robert Endre Tarjan (1997)

> Home

Details and statistics

DOI: 10.1007/BF02614369

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/Tarjan97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/Tarjan97
Robert Endre Tarjan:
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Math. Program. 77: 169-177 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.