A Note on the Balanced ST-Connectivity
Abstract
We prove that every YES instance of Balanced ST-Connectivity has a balanced path of polynomial length.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.