A Note on the Balanced ST-Connectivity

Details A Note on the Balanced ST-Connectivity A Note on the Balanced ST-Connectivity

2012-04-03

arxiv.org/abs/1204.0816v1

Computer Science

Computational Complexity

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

A Note on the Balanced ST-Connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Note on the Balanced ST-Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on the Balanced ST-Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-31133