scientific article

zbMath0699.68088MaRDI QIDQ3477977

Günter Rote

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear systemsnetwork programmingshortest pathautomatic differentiationfinite automatonanalysismatrix inversionnumerical algorithmsalgebraic algorithmsblock decompositionnetwork problemscomputationalregular expressionoptimal pathsalgebraic path problemGauß-Jordan eliminationpath and circuit problemscomputations on matricesiteration equation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (10)

Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints ⋮ Distance-related invariants on polygraphs ⋮ An algebraic framework for multi-objective and robust variants of path problems ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ Solving multi-metric network problems: an interplay between idempotent semiring rules ⋮ Table design in dynamic programming ⋮ Security and trust for wireless autonomic networks. Systems and control methods ⋮ On the implementation of automatic differentiation tools ⋮ Fast distance multiplication of unit-Monge matrices ⋮ A differential semantics for jointree algorithms

This page was built for publication: