"On the Flattest Common Supersequence Method for Deadlock-Free Routing in ..."

Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan (2000)

> Home

Details and statistics

DOI: 10.1007/S002240010011

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/LaingCD00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/LaingCD00
Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan:
On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks. Theory Comput. Syst. 33(5/6): 393-426 (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.