Connectivity [kon-ek-tiv-i-tee, kuh-nek‐]

St-non-connectivity

st-non-connectivity refers to a problem in computer science and computational complexity theory, a decision problem asking if two vertices s and t in a directed graph are not connected by a path.

The algorithm is in the complexity class co-NL, and hence in the class NL, by the Immerman-Szelepcsényi Theorem.

See also

Search another word or see Connectivityon Dictionary | Thesaurus |Spanish
  • Please Login or Sign Up to use the Recent Searches feature