|
Concave paths in graphs and networks
Boris Horvat, Tomaž Pisanski and Primož Lukšic
In: TRA, Transport Research Arena Europe 2008, 21-24 Apr 2008, Ljubljana, Slovenija.
Abstract We encountered special types of paths when dealing with transport problems in graphs and networks. A path defined by its successive vertices u1,u2,…,ul is called concave if for any vertex x of a graph (or a network) the sequence of distances D (x,u1 ),D (x,u2 ),…,D(x,ul ) is at first monotonically increasing and then monotonically decreasing. The paper presents some properties of concave paths and an algorithm for finding concave paths of maximal length. | EPrint Type: | Conference or Workshop Item (Paper) |
|---|
| Project Keyword: | Project Keyword UNSPECIFIED |
|---|
| Subjects: | Theory & Algorithms |
|---|
| ID Code: | 8169 |
|---|
| Deposited By: | Boris Horvat |
|---|
| Deposited On: | 21 February 2012 |
|---|
[Edit]
|
