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
CountryUnited States
CityResearch Triange Park, NC
Period3/8/023/13/02

Fingerprint

Labels

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Mizoguchi, Y. (2002). Shortest path length calculation using graph transformations. In J. H. Caulfield, S. H. Chen, H. D. Cheng, R. Duro, J. H. Caufield, S. H. Chen, H. D. Cheng, R. Duro, ... V. Honavar (Eds.), Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 (Vol. 6, pp. 358-361)

Shortest path length calculation using graph transformations. / Mizoguchi, Yoshihiro.

Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002. ed. / J.H. Caulfield; S.H. Chen; H.D. Cheng; R. Duro; J.H. Caufield; S.H. Chen; H.D. Cheng; R. Duro; V. Honavar. Vol. 6 2002. p. 358-361.

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

Mizoguchi, Y 2002, Shortest path length calculation using graph transformations. in JH Caulfield, SH Chen, HD Cheng, R Duro, JH Caufield, SH Chen, HD Cheng, R Duro & V Honavar (eds), Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002. vol. 6, pp. 358-361, Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002, Research Triange Park, NC, United States, 3/8/02.
Mizoguchi Y. Shortest path length calculation using graph transformations. In Caulfield JH, Chen SH, Cheng HD, Duro R, Caufield JH, Chen SH, Cheng HD, Duro R, Honavar V, editors, Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002. Vol. 6. 2002. p. 358-361
Mizoguchi, Yoshihiro. / Shortest path length calculation using graph transformations. Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002. editor / J.H. Caulfield ; S.H. Chen ; H.D. Cheng ; R. Duro ; J.H. Caufield ; S.H. Chen ; H.D. Cheng ; R. Duro ; V. Honavar. Vol. 6 2002. pp. 358-361
@inproceedings{a9b15d7fe7a9430e93e2b42b21a485e8,
title = "Shortest path length calculation using graph transformations",
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.",
author = "Yoshihiro Mizoguchi",
year = "2002",
language = "English",
isbn = "0970789017",
volume = "6",
pages = "358--361",
editor = "J.H. Caulfield and S.H. Chen and H.D. Cheng and R. Duro and J.H. Caufield and S.H. Chen and H.D. Cheng and R. Duro and V. Honavar",
booktitle = "Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002",

}

TY - GEN

T1 - Shortest path length calculation using graph transformations

AU - Mizoguchi, Yoshihiro

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=1642414214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1642414214&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:1642414214

SN - 0970789017

VL - 6

SP - 358

EP - 361

BT - Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002

A2 - Caulfield, J.H.

A2 - Chen, S.H.

A2 - Cheng, H.D.

A2 - Duro, R.

A2 - Caufield, J.H.

A2 - Chen, S.H.

A2 - Cheng, H.D.

A2 - Duro, R.

A2 - Honavar, V.

ER -