"A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees."

Sándor P. Fekete et al. (1997)

> Home

Details and statistics

DOI: 10.1006/JAGM.1997.0862

access: closed

type: Journal Article

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/FeketeKKRY97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/FeketeKKRY97
Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young:
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. J. Algorithms 24(2): 310-324 (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.