English

A Note on the Balanced ST-Connectivity

Computational Complexity 2012-04-05 v1 Data Structures and Algorithms

Abstract

We prove that every YES instance of Balanced ST-Connectivity has a balanced path of polynomial length.

Cite

@article{arxiv.1204.0816,
  title  = {A Note on the Balanced ST-Connectivity},
  author = {Shiva Kintali and Asaf Shapira},
  journal= {arXiv preprint arXiv:1204.0816},
  year   = {2012}
}
R2 v1 2026-06-21T20:44:19.231Z