DocumentCode :
1104970
Title :
An Improved Upper Bound for the Finite Delay of Graphs
Author :
Vilfan, Bostjan
Issue :
5
fYear :
1970
fDate :
5/1/1970 12:00:00 AM
Firstpage :
453
Lastpage :
456
Abstract :
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.
Keywords :
Delay of graphs, finite automata theory, graph theory, nondeterministic finite automata, sequential Boolean equations.; Automata; Computer science; Computerized monitoring; Delay; Equations; Graph theory; Upper bound; Delay of graphs, finite automata theory, graph theory, nondeterministic finite automata, sequential Boolean equations.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1970.222944
Filename :
1671537
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1104970
بازگشت