The Parallel Recognition of Classes of Graphs

  • Authors:
  • F. L. Van Scoy

  • Affiliations:
  • Department of Computer Science, West Virginia University

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1980

Quantified Score

Hi-index 14.99

Visualization

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.