st-connectivity

decision problem in graph theory
Thing Decision Problem Q1361537

Facts

3 properties
Instance of
decision problem
Computational complexity
NL[3]
🏷️ Also known as
en graph accessibility problem en STCON en st-connectivity en GAP de STCON de st-Erreichbarkeit de USTCON hu st-elérhetőség hu st-összefüggőség it STCON pt Conectividade st zh st連通性
🔖 Identifiers · 2
Freebase ID
/m/085m2j
Microsoft Academic ID (discontinued)
134013329

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Computational complexity 1
NL
Instance of 1
Uses 1
Press Enter · cited answer in seconds

Summary

st-connectivity is a decision problem[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . Computability and Complexity Theory. wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). st-connectivity. Retrieved November 18, 2026, from https://4ort.xyz/entity/st-connectivity
MLA “st-connectivity.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Nov. 2026, https://4ort.xyz/entity/st-connectivity.
BibTeX @misc{4ortxyz_st-connectivity_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{st-connectivity}}, year = {2026}, url = {https://4ort.xyz/entity/st-connectivity}, note = {Accessed: 2026-11-18}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): st-connectivity — https://4ort.xyz/entity/st-connectivity (retrieved 2026-11-18)

Canonical URL: https://4ort.xyz/entity/st-connectivity · Last refreshed: