The Parallel Recognition of Classes of Graphs
- 1 July 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-29 (7) , 563-570
- https://doi.org/10.1109/TC.1980.1675627
Abstract
Parallel cellular algorithms for recognizing adjacency and incidence matrices of several classes of graphs are given. These classes include cubic graphs, complete graphs, connected graphs, and trees.Keywords
This publication has 2 references indexed in Scilit:
- Two-dimensional formal languages and pattern recognition by cellular automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- A Theorem on Boolean MatricesJournal of the ACM, 1962