ZIB

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

An algorithm for the determination of longest distances in a graph (1975)

Noltemeier, Hartmut

Springer

Mathematical programming 9 (1975), S. 350-357

add to mindlist on the mindlist

Details

ISSN: 1436-4646

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract This paper presents an algorithm for ranking the vertices of a directed graph. Its space and time requirements are bounded byc 1 n 2 +c 2, wheren is the number of vertices of the graph andc 1,c 2 are positive constants which are independent of the size or other properties of the graph. The algorithm can be easily modified to solve the problem of determining longest distances from a vertex to all other vertices in a positive real valued graph with at mostc 1 n 2 +c 2 elementary operations; the same result holds for shortest distances in negative real valued graphs.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01681355

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit