st-connectivity
decision problem in graph theory
Press Enter · cited answer in seconds
0 sources
st-connectivity
Summary
st-connectivity is a decision problem[1]. st-connectivity draws 14 Wikipedia views per month (decision_problem category, ranking #3 of 4).[2]
Key Facts
- st-connectivity's instance of is recorded as decision problem[3].
- st-connectivity's Freebase ID is recorded as /m/085m2j[4].
- st-connectivity's uses is recorded as reachability[5].
- st-connectivity's Microsoft Academic ID is recorded as 134013329[6].
- st-connectivity's computational complexity is recorded as NL[7].
Why It Matters
st-connectivity draws 14 Wikipedia views per month (decision_problem category, ranking #3 of 4).[2] st-connectivity is known by 7 alternative names across languages and contexts.[8]