By Topic

The Parallel Recognition of Classes of Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Van Scoy, F.L. ; Department of Computer Science, West Virginia University

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-29 ,  Issue: 7 )