"An edge-swap heuristic for generating spanning trees with minimum number ..."

Ricardo M. A. Silva et al. (2014)

> Home

Details and statistics

DOI: 10.1007/S11590-013-0665-Y

access: closed

type: Journal Article

metadata version: 2025-08-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ol/SilvaSRMGF14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/SilvaSRMGF14
Ricardo M. A. Silva, Diego M. Silva, Mauricio G. C. Resende, Geraldo R. Mateus, José Fernando Gonçalves, Paola Festa:
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. Optim. Lett. 8(4): 1225-1243 (2014)

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.