"On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case ..."

Martin Makuch, Peter Ruzicka (2001)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2004-02-02

- no documents available
- export record
  dblp key:
  - conf/sirocco/MakuchR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sirocco/MakuchR01
Martin Makuch, Peter Ruzicka:
On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks. SIROCCO 2001: 243-258

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.