|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| B. Vilfan, "An Improved Upper Bound for the Finite Delay of Graphs," IEEE Transactions on Computers, vol. 19, no. 5, pp. 453-456, May, 1970. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1970.222944, author = {B. Vilfan}, title = {An Improved Upper Bound for the Finite Delay of Graphs}, journal ={IEEE Transactions on Computers}, volume = {19}, number = {5}, issn = {0018-9340}, year = {1970}, pages = {453-456}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.222944}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Improved Upper Bound for the Finite Delay of Graphs IS - 5 SN - 0018-9340 SP453 EP456 EPD - 453-456 A1 - B. Vilfan, PY - 1970 KW - Delay of graphs KW - finite automata theory KW - graph theory KW - nondeterministic finite automata KW - sequential Boolean equations. VL - 19 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
Delay of graphs, finite automata theory, graph theory, nondeterministic finite automata, sequential Boolean equations.
Citation:
B. Vilfan, "An Improved Upper Bound for the Finite Delay of Graphs," IEEE Transactions on Computers, vol. 19, no. 5, pp. 453-456, May 1970, doi:10.1109/T-C.1970.222944
Usage of this product signifies your acceptance of the Terms of Use.