On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Theory of Computing Systems

On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks

Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan

Journal Title: Theory of Computing Systems

Date: 2000

Volume: 33

Issue: 5/6

p. 393 - 426

For further information about this item go to:

http://link.springer.de/link/service/journals/00224/contents/00/10011/

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12