Accession Number:

ADA058792

Title:

Cellular Graph Acceptors, 4.

Descriptive Note:

Interim rept.,

Corporate Author:

MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER

Personal Author(s):

Report Date:

1978-06-01

Pagination or Media Count:

51.0

Abstract:

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

Subject Categories:

  • Theoretical Mathematics
  • Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE