An Improved Upper Bound for the Finite Delay of Graphs
Boštjan Vilfan · IEEE Transactions on Computers · 1970
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.