"On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings."

Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan (1997)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2004-09-08

- no documents available
- export record
  dblp key:
  - conf/sirocco/AnnexsteinBS97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sirocco/AnnexsteinBS97
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan:
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO 1997: 12-23

a service of

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.