SHORTEST PATHS IN A NETWORK WITH TWO COST FUNCTIONS.

Research output: Contribution to conferencePaperpeer-review

2 Scopus citations

Abstract

Given a network composed of an undirected graph and a length function for the edges, the problem of finding paths of both minimum number of edges and minimum length from a source vertex to all other vertices is considered. A communication network application is then presented. An algorithm which is a generalization of the breadth first search technique is given and its complexity is analyzed.

Original languageEnglish (US)
Pages211-215
Number of pages5
StatePublished - Jan 1 1978
Externally publishedYes
EventProc of the Jerusalem Conf on Inf Technol, 3rd (JCIT3) - Haifa, Isr
Duration: Aug 6 1978Aug 9 1978

Other

OtherProc of the Jerusalem Conf on Inf Technol, 3rd (JCIT3)
CityHaifa, Isr
Period8/6/788/9/78

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'SHORTEST PATHS IN A NETWORK WITH TWO COST FUNCTIONS.'. Together they form a unique fingerprint.

Cite this