"Generating a smallest binary tree by proper selection of the longest edges ..."

Jose M. G. Salmerón et al. (2017)

> Home

Details and statistics

DOI: 10.1007/S10878-015-9970-Y

access: open

type: Journal Article

metadata version: 2019-09-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jco/SalmeronACGHG17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/SalmeronACGHG17
Jose M. G. Salmerón, Guillermo Aparicio, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix, Boglárka G.-Tóth:
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement. J. Comb. Optim. 33(2): 389-402 (2017)

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.