scientific article; zbMATH DE number 4147534
zbMATH Open0699.68088MaRDI QIDQ3477977FDOQ3477977
Authors: Günter Rote 
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
- Path Problems in Structured Graphs
- Paths in graphs
- Path problems in networks
- scientific article; zbMATH DE number 810052
- Path graphs
- scientific article; zbMATH DE number 1161279
- Paths and edge-connectivity in graphs
- Path Problems in Complex Networks
- scientific article; zbMATH DE number 969167
- Graph path minimization problem
linear systemsshortest pathmatrix inversionnumerical algorithmsblock decompositionnetwork problemsanalysisautomatic differentiationfinite automatonalgebraic algorithmscomputationalregular expressionoptimal pathsnetwork programmingalgebraic path problempath and circuit problemscomputations on matricesiteration equationGauß-Jordan elimination
Direct numerical methods for linear systems and matrix inversion (65F05) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Iterative numerical methods for linear systems (65F10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Paths and cycles (05C38)
Cited In (28)
- Title not available (Why is that?)
- Composite path algebras for solving path problems in graphs.
- On the implementation of automatic differentiation tools
- Graph path minimization problem
- Title not available (Why is that?)
- Path hitting in acyclic graphs
- A preference-based approach to spanning trees and shortest paths problems
- Fast and efficient solution of path algebra problems
- Connected components and minimum paths
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
- Path Problems in Structured Graphs
- Some results dealing with the algebraic approach to path problems in graphs
- A differential semantics for jointree algorithms
- Distance-related invariants on polygraphs
- Fast distance multiplication of unit-Monge matrices
- Title not available (Why is that?)
- An algebraic framework for multi-objective and robust variants of path 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Path problems in networks
- Title not available (Why is that?)
- Calculating graph algorithms for dominance and shortest path
- Path Problems in Complex Networks
- Avoidable paths in graphs
- Paths and circuits in g-graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477977)
