"Embedding complete k-ary trees into k-square 2-D meshes with optimal edge ..."

Jan Trdlicka, Pavel Tvrdík (2000)

> Home

Details and statistics

DOI: 10.1016/S0167-8191(00)00009-0

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pc/TrdlickaT00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/TrdlickaT00
Jan Trdlicka, Pavel Tvrdík:
Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion. Parallel Comput. 26(6): 783-790 (2000)

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.