An Algorithm of Topological Ordering for Unique Representation of Graphs

[+] Author and Article Information
Jeong Tae Kim, Byung Man Kwak

Department of Mechanical Engineering, Korea Advanced Institute of Science and Technology, Cheongryang P.O. Box 150, Seoul, Korea

J. Mech. Des 114(1), 103-108 (Mar 01, 1992) (6 pages) doi:10.1115/1.2916902 History: Received March 01, 1990; Revised July 01, 1990; Online June 02, 2008


An algorithm of topological ordering of vertices is proposed for generating a unique edge list of a given graph, and used for the isomorphism test. This also makes it possible to find the sets of similar vertices and edges of the graph. This is applied to the graphs representing kinematic chains.

Copyright © 1992 by The American Society of Mechanical Engineers
Topics: Algorithms
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In