A new path algebra for finding paths in graphs

Proceedings of the International Conference on Information Technology Interfaces, ITI

Volumn , Issue , 2004, Pages 657-662

  Manger, Robert ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Computational complexity; Directed graphs; Finding paths; Graph theory; Path algebras; Path problems; Semirings

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

DIRECTED GRAPHS; FINDING PATHS; PATH ALGEBRAS; PATH PROBLEMS; SEMIRINGS;

ALGEBRA;

EID: 14944352380     PISSN: 13301012     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Carré B. Graphs and Networks. Oxford: Oxford University Press; 1979.
2. Huckenbeck U. Extremal Paths in Graphs. Berlin: Akademie Verlag; 1997.
3. Le Boudec J-Y, Thiran P. Network Calculus. LNCS 2050. Berlin: Springer; 2001.
4. Manger R. Gaussian block algorithms for solving path problems. Mathematical Communications 1998; 3: 67-81.
5. Manger R. Solving path problems on a network of computers. Informatica 2002; 26: 91-100.
6. Mohri M. Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics 2002; 7: 321-350.
7. Rote G. Path problems in graphs. Computing Supplement 1990; 7: 155-189.
8. Russling M. Deriving a class of layer-oriented graph algorithms. Science of Computer Programming 1996; 26: 117-132.