Cellular Graph Acceptors, 3.

Abstract

In earlier reports, cellular acceptors were studied whose languages are sets of d-graphs, i.e., labelled graphs of bounded degree whose arcs at each node are numbered. This report discusses acceptance tasks that depend on the concept of d-graph isomorphism -- in particular, the task of deciding whether a d-graph has a d-subgraph isomorphic to a given d-graph. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1978
Accession Number
ADA054975

Entities

People

  • Angela Wu

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms
  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Automata
  • Computer Science
  • Computers
  • Diameters
  • Generators
  • Homogeneity
  • Identities
  • Language
  • Maryland
  • Scientific Research
  • Sequences
  • Two Dimensional
  • Universities

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.