Publication:3477977

zbMath0699.68088MaRDI QIDQ3477977

Günter Rote

Publication date: 1990

zbMATH Keywords

linear systems; network programming; shortest path; automatic differentiation; finite automaton; analysis; matrix inversion; numerical algorithms; algebraic algorithms; block decomposition; network problems; computational; regular expression; optimal paths; algebraic path problem; Gauß-Jordan elimination; path and circuit problems; computations on matrices; iteration equation

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

90C90: Applications of mathematical programming

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

65F10: Iterative numerical methods for linear systems

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Solving multi-metric network problems: an interplay between idempotent semiring rules, A preference-based approach to spanning trees and shortest paths problems, A differential semantics for jointree algorithms, On the implementation of automatic differentiation tools, Distance-related invariants on polygraphs, Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints, Table design in dynamic programming