Shortest path length calculation using graph transformations

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We consider a graph with labels of edges. A label means the length of an edge. We present a method to compute the length of a shortest path between two vertices using graph transformations. We introduce graph transformation rules which preserve the length ofpaths. Reducing to a simple graph which contains two vertices, we finally calculate the length of a shortest path of those two vertices. There were several algorithms for computing network reliabilities using graph transformations. We use the same framework for applying the graph transformation rules, but our transformation rules do not calculate the network reliabilities but calculate the length of a shortest path.

    Original languageEnglish
    Title of host publicationProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
    EditorsJ.H. Caulfield, S.H. Chen, H.D. Cheng, R. Duro, J.H. Caufield, S.H. Chen, H.D. Cheng, R. Duro, V. Honavar
    Pages358-361
    Number of pages4
    Volume6
    Publication statusPublished - 2002
    EventProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 - Research Triange Park, NC, United States
    Duration: Mar 8 2002Mar 13 2002

    Other

    OtherProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
    Country/TerritoryUnited States
    CityResearch Triange Park, NC
    Period3/8/023/13/02

    All Science Journal Classification (ASJC) codes

    • Computer Science(all)

    Fingerprint

    Dive into the research topics of 'Shortest path length calculation using graph transformations'. Together they form a unique fingerprint.

    Cite this