Work

A Note on the Balanced ST-Connectivity

Year: 2012
Type: preprint
Abstract: We prove that every YES instance of Balanced ST-Connectivity has a balanced path of polynomial length.
Authors: Kintali, Shiva, Shapira, Asaf
Language: English
Open Access status: green
OpenAlex ID: W2245804898
Cites: 2
Cited by:
Related to: 10