Cellular Graph Acceptors, 4.
MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER
Pagination or Media Count:
Diameter-time algorithms are presented for recognition of rectangular and square arrays, Eulerian graphs, bipartite and complete bipartite graphs, stars, and wheels by cellular d-graph acceptors. Slower algorithms are given for construction of a depth-first spanning tree area time and for identification of cut nodes, borders, and central points diameterarea time. The recognition of planarity is also discussed. Author
- Theoretical Mathematics