Cellular Graph Acceptors, 4.

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 (diameter'area time). The recognition of planarity is also discussed. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1978
Accession Number
ADA058792

Entities

People

  • Angela Wu

Organizations

  • University of Maryland

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Automata
  • Classification
  • Computer Science
  • Computers
  • Construction
  • Diameters
  • Identification
  • Language
  • Maryland
  • Mathematics
  • Recognition
  • Rejection
  • Time Signals
  • Trees
  • Universities

Readers

  • Explosive Engineering.
  • Graph Algorithms and Convex Optimization.