"A linear algorithm for finding the k-broadcast center of a tree."

Hovhannes A. Harutyunyan, Arthur L. Liestman, Bin Shao (2009)

> Home

Details and statistics

DOI: 10.1002/NET.20270

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/HarutyunyanLS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/HarutyunyanLS09
Hovhannes A. Harutyunyan, Arthur L. Liestman, Bin Shao:
A linear algorithm for finding the k-broadcast center of a tree. Networks 53(3): 287-292 (2009)

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.