A Note on the Balanced ST-Connectivity
classification
💻 cs.CC
cs.DS
keywords
balancedst-connectivityeveryinstancelengthnotepathpolynomial
read the original abstract
We prove that every YES instance of Balanced ST-Connectivity has a balanced path of polynomial length.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.