Referenced Items are not available for this document.
The notion of graphs solvable with finite delay appears in [1] and [4]. In this note the upper bound on finite delay for a graph with N nodes is reduced to the order of 2N2using techniques from finite automata theory.
Published in:
Computers, IEEE Transactions on
(Volume:C-19
,
Issue:
5
)
Date of Publication: May 1970
- Page(s):
- 453 - 456
- ISSN :
- 0018-9340
- Digital Object Identifier :
- 10.1109/T-C.1970.222944
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 14 August 2006
- Issue Date :
- May 1970
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
