Efficient algorithms for solving systems of linear equations and path problems

DOI10.1007/3-540-55210-3_177zbMath1494.68320OpenAlexW1585120303MaRDI QIDQ5096775

Richard E. Stearns, Venkatesh Radhakrishnan, Harry 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

Mathematics Subject Classification ID

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

Related Items

Unified all-pairs shortest path algorithms in the chordal hierarchy, Dynamic algorithms for graphs of bounded treewidth

Cites Work

• Parallel nested dissection for path algebra computations
• Partitioning, tearing and modification of sparse linear systems
• Algebraic structures for transitive closure
• Graph minors. II. Algorithmic aspects of tree-width
• Complexity of Finding Embeddings in a k-Tree
• 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
• Generalized Nested Dissection
• Applications of a Planar Separator Theorem
• Fast Algorithms for Solving Path Problems
• Regular Algebra Applied to Path-finding Problems
• Linear-time computation of optimal subgraphs of decomposable graphs
• Power indices and easier hard problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item