SHORTEST PATHS IN A NETWORK WITH TWO COST FUNCTIONS.

Yehoshua Perl

SHORTEST PATHS IN A NETWORK WITH TWO COST FUNCTIONS.

Research output: Contribution to conference › Paper › peer-review

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 language	English (US)
Pages	211-215
Number of pages	5
State	Published - 1978
Externally published	Yes
Event	Proc of the Jerusalem Conf on Inf Technol, 3rd (JCIT3) - Haifa, Isr Duration: Aug 6 1978 → Aug 9 1978

Other

Other	Proc of the Jerusalem Conf on Inf Technol, 3rd (JCIT3)
City	Haifa, Isr
Period	8/6/78 → 8/9/78

All Science Journal Classification (ASJC) codes

General Engineering

Cite this

@conference{4064df838a044eb6a9a18d49039e6c87,

title = "SHORTEST PATHS IN A NETWORK WITH TWO COST FUNCTIONS.",

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.",

author = "Yehoshua Perl",

year = "1978",

language = "English (US)",

pages = "211--215",

note = "Proc of the Jerusalem Conf on Inf Technol, 3rd (JCIT3) ; Conference date: 06-08-1978 Through 09-08-1978",

}

TY - CONF

T1 - SHORTEST PATHS IN A NETWORK WITH TWO COST FUNCTIONS.

AU - Perl, Yehoshua

PY - 1978

Y1 - 1978

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

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

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

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

M3 - Paper

AN - SCOPUS:0018062783

SP - 211

EP - 215

T2 - Proc of the Jerusalem Conf on Inf Technol, 3rd (JCIT3)

Y2 - 6 August 1978 through 9 August 1978

ER -

SHORTEST PATHS IN A NETWORK WITH TWO COST FUNCTIONS.

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this