"On maximally distant spanning trees of a graph."

Tiko Kameda (1976)

> Home

Details and statistics

DOI: 10.1007/BF02276756

access: closed

type: Journal Article

metadata version: 2021-11-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computing/Kameda76
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computing/Kameda76
Tiko Kameda:
On maximally distant spanning trees of a graph. Computing 17(2): 115-119 (1976)

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.