St-non-connectivity

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.

ee also

* st-connectivity


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Non-rapid eye movement sleep — slow eyes redirects here. For sloe eyes, see Prunus spinosa. Non rapid eye movement, or NREM is, collectively, sleep stages 1 – 3, previously known as stages 1 – 4. Rapid eye movement sleep (REM) is not included. There are distinct… …   Wikipedia

  • St-connectivity — In computer science and computational complexity theory, st connectivity is a decision problem asking, for vertices s and t in a directed graph, if t is reachable from s .Formally, the decision problem is given by PATH = { | D is a directed graph …   Wikipedia

  • Open Database Connectivity — In computing, Open Database Connectivity (ODBC) provides a standard software API method for using database management systems (DBMS). The designers of ODBC aimed to make it independent of programming languages, database systems, and operating… …   Wikipedia

  • Sleep (non-human) — Sleep in non human animals refers to how the behavioral and physiological state of sleep, mainly characterized by reversible unconsciousness, non responsiveness to external stimuli, and motor passivity, appears in different categories of animals …   Wikipedia

  • Immerman–Szelepcsényi theorem — The Immerman–Szelepcsényi Theorem was proven independently by Neil Immerman and Róbert Szelepcsényi in 1987, for which they shared the 1995 Gödel Prize. In its general form the theorem states that NSPACE = co NSPACE. In other words, if a… …   Wikipedia

  • Connectome — A connectome is a comprehensive map of neural connections in the brain. The production and study of connectomes, known as connectomics, may range in scale from a detailed map of the full set of neurons and synapses within part or all of the… …   Wikipedia

  • Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

  • National broadband plans from around the world — Broadband is a term normally considered to be synonymous with a high speed connection to the internet. The term itself is technology neutral; broadband can be delived by a range of technologies including DSL, LTE or next generation access. This… …   Wikipedia

  • System Architecture Evolution — (aka SAE) is the core network architecture of 3GPP s LTE wireless communication standard. SAE is the evolution of the GPRS Core Network, with some differences: simplified architecture all IP Network (AIPN) support for higher throughput and lower… …   Wikipedia

  • USB — This article is about the computer bus to connect peripherals. For other uses of USB, see USB (disambiguation). Universal Serial Bus Original logo Type Computer Hardware Bus …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”