Presentation	1993/12/15 Computing the Weights of Edges with Respect to Shortest Paths in a Graph Peng Cheng, Shigeru Masuyama,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	This paper considers a directed graph where each edge is assigned a real number,called length.We propose polynomial time algorithms for computing the weight of each edge to be defined as the numbers of shortest paths passing the edge from a specified source s to every other vertex and between all vertex pairs, respectively,for a directed graph with neither cycle of negative length nor cycle of length zero.Furthermore,it is shown that proposed algorithms are also valid for an undirected graph with each edge having a positive length.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Graph Theory / shortest path / polynomial time algorithm
Paper #	COMP93-62
Date of Issue

Conference Information
Committee	COMP
Conference Date	1993/12/15(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Theoretical Foundations of Computing (COMP)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Computing the Weights of Edges with Respect to Shortest Paths in a Graph
Sub Title (in English)
Keyword(1)	Graph Theory
Keyword(2)	shortest path
Keyword(3)	polynomial time algorithm
1st Author's Name	Peng Cheng
1st Author's Affiliation	Department of Knowledge-Based Information Engineering,Toyohashi University of Technology()
2nd Author's Name	Shigeru Masuyama
2nd Author's Affiliation	Department of Knowledge-Based Information Engineering,Toyohashi University of Technology
Date	1993/12/15
Paper #	COMP93-62
Volume (vol)	vol.93
Number (no)	379
Page	pp.pp.-
#Pages	10
Date of Issue