Efficient algorithms for solving systems of linear equations and path problems

DOI10.1007/3-540-55210-3_177zbMATH Open1494.68320OpenAlexW1585120303MaRDI QIDQ5096775FDOQ5096775

Authors: V. Radhakrishnan, R. E. Stearns, H. B. III Hunt 

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_177

Recommendations

• Efficient solution of linear systems of equations with recursive structure
• Fast and efficient solution of path algebra problems
• An algorithmic approach to linear systems
• Stable and Efficient Algorithms for Structured Systems of Linear Equations
• scientific article; zbMATH DE number 4215257
• An efficient algorithm for solving system of nonlinear equations
• Algorithms for structured linear systems solving and their implementation
• scientific article; zbMATH DE number 3968322
• scientific article; zbMATH DE number 3883605

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• Generalized Nested Dissection
• Title not available (Why is that?)
• Applications of a Planar Separator Theorem
• Complexity of Finding Embeddings in a k-Tree
• Graph minors. II. Algorithmic aspects of tree-width
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular Algebra Applied to Path-finding Problems
• Title not available (Why is that?)
• Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• Linear-time computation of optimal subgraphs of decomposable graphs
• Power indices and easier hard problems
• Fast Algorithms for Solving Path Problems
• Algebraic structures for transitive closure
• Partitioning, tearing and modification of sparse linear systems
• Parallel nested dissection for path algebra computations
• Title not available (Why is that?)

Cited In (5)

• On Linear Recognition of Tree-Width at Most Four
• A family of efficient regular arrays for algebraic path problem
• Linear-time LUP decomposition of forest-like matrices
• Dynamic algorithms for graphs of bounded treewidth
• Unified all-pairs shortest path algorithms in the chordal hierarchy

This page was built for publication: Efficient algorithms for solving systems of linear equations and path problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096775)