Reverse mathematics of some topics from algorithmic graph theory
Peter Clote, Jeffry L. Hirst · Fundamenta Mathematicae · 1998
This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are consid