Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

St-connectivity

Known as: STCON, ST Connectivity, STConnectivity 
In computer science and computational complexity theory, st-connectivity or STCON is a decision problem asking, for vertices s and t in a directed… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Reactive system synthesis from safety specifications is a promising approach to the correct-by-construction methodology. The… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
2015
2015
This paper combines the benefits of Polyhedral Abstract Interpretation poly-AI with the flexibility of Property Directed… Expand
  • table 1
Is this relevant?
Highly Cited
2012
Highly Cited
2012
The IC3 algorithm was recently introduced for proving properties of finite state reactive systems. It has been applied very… Expand
  • figure 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Last spring, in March 2010, Aaron Bradley published the first truly new bit-level symbolic model checking algorithm since Ken… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space… Expand
  • figure 1
Is this relevant?
2007
2007
The factored state representation and concurrency semantics of Petri nets are closely related to those of concurrent planning… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Graph abstractions are extensively used to understand and solve challenging computational problems in various scientific and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Given a Boolean formula, do its solutions form a connected subgraph of the hypercube? This and other related connectivity… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space… Expand
  • figure 1
Is this relevant?
1998
1998
In many applications of graph algorithms, including communication networks, graphics, and VLSI design, one encounters graphs… Expand
Is this relevant?