YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Mechanical Design
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Mechanical Design
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    An Algorithm of Topological Ordering for Unique Representation of Graphs

    Source: Journal of Mechanical Design:;1992:;volume( 114 ):;issue: 001::page 103
    Author:
    Jeong Tae Kim
    ,
    Byung Man Kwak
    DOI: 10.1115/1.2916902
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: 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.
    keyword(s): Algorithms ,
    • Download: (533.0Kb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      An Algorithm of Topological Ordering for Unique Representation of Graphs

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/110659
    Collections
    • Journal of Mechanical Design

    Show full item record

    contributor authorJeong Tae Kim
    contributor authorByung Man Kwak
    date accessioned2017-05-08T23:39:12Z
    date available2017-05-08T23:39:12Z
    date copyrightMarch, 1992
    date issued1992
    identifier issn1050-0472
    identifier otherJMDEDB-27594#103_1.pdf
    identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/110659
    description abstractAn 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.
    publisherThe American Society of Mechanical Engineers (ASME)
    titleAn Algorithm of Topological Ordering for Unique Representation of Graphs
    typeJournal Paper
    journal volume114
    journal issue1
    journal titleJournal of Mechanical Design
    identifier doi10.1115/1.2916902
    journal fristpage103
    journal lastpage108
    identifier eissn1528-9001
    keywordsAlgorithms
    treeJournal of Mechanical Design:;1992:;volume( 114 ):;issue: 001
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian