"Cost-minimal trees in directed acyclic graphs."

Ludwig Nastansky, Stanley M. Selkow, Neil F. Stewart (1974)

> Home

Details and statistics

DOI: 10.1007/BF01949715

access: closed

type: Journal Article

metadata version: 2020-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mmor/NastanskySS74
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mmor/NastanskySS74
Ludwig Nastansky, Stanley M. Selkow, Neil F. Stewart:
Cost-minimal trees in directed acyclic graphs. Z. Oper. Research 18(1): 59-67 (1974)

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.