Path Problems in Graphs

This publication has 10 references indexed in Scilit:

• Transitive closure and related semiring properties via eliminants
  Theoretical Computer Science, 1985
• A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)
  Computing, 1985
• First Partial Differentiation by Computer with an Application to Categorical Data Analysis
  The American Statistician, 1984
• The complexity of partial derivatives
  Theoretical Computer Science, 1983
• The complexity of selection and ranking in X + Y and matrices with sorted columns
  Journal of Computer and System Sciences, 1982
• Fast Algorithms for Solving Path Problems
  Journal of the ACM, 1981
• A Unified Approach to Path Problems
  Journal of the ACM, 1981
• A Separator Theorem for Planar Graphs
  SIAM Journal on Applied Mathematics, 1979
• Generalized Nested Dissection
  SIAM Journal on Numerical Analysis, 1979
• Algebraic structures for transitive closure
  Theoretical Computer Science, 1977