"Use of dynamic trees in a network simplex algorithm for the maximum flow ..."

Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan (1991)

> Home

Details and statistics

DOI: 10.1007/BF01594940

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/GoldbergGT91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/GoldbergGT91
Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan:
Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Program. 50: 277-290 (1991)

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.