Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/St-connectivity> ?p ?o }
Showing triples 1 to 50 of
50
with 100 triples per page.
- St-connectivity abstract "In computer science and computational complexity theory, st-connectivity or STCON 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 byPATH = {〈D, s, t〉 | D is a directed graph with a path from vertex s to t}.".
- St-connectivity wikiPageID "2833034".
- St-connectivity wikiPageLength "3178".
- St-connectivity wikiPageOutDegree "21".
- St-connectivity wikiPageRevisionID "685348497".
- St-connectivity wikiPageWikiLink Category:Directed_graphs.
- St-connectivity wikiPageWikiLink Category:Graph_connectivity.
- St-connectivity wikiPageWikiLink Category:NL-complete_problems.
- St-connectivity wikiPageWikiLink Computational_complexity_theory.
- St-connectivity wikiPageWikiLink Computer_science.
- St-connectivity wikiPageWikiLink Decision_problem.
- St-connectivity wikiPageWikiLink Directed_graph.
- St-connectivity wikiPageWikiLink First-order_reduction.
- St-connectivity wikiPageWikiLink Grace_Murray_Hopper_Award.
- St-connectivity wikiPageWikiLink Graph_(discrete_mathematics).
- St-connectivity wikiPageWikiLink Immerman–Szelepcsényi_theorem.
- St-connectivity wikiPageWikiLink L_(complexity).
- St-connectivity wikiPageWikiLink Log-space_reduction.
- St-connectivity wikiPageWikiLink NL-complete.
- St-connectivity wikiPageWikiLink NL_(complexity).
- St-connectivity wikiPageWikiLink Non-deterministic_Turing_machine.
- St-connectivity wikiPageWikiLink Omer_Reingold.
- St-connectivity wikiPageWikiLink P_(complexity).
- St-connectivity wikiPageWikiLink Reachability.
- St-connectivity wikiPageWikiLink SL_(complexity).
- St-connectivity wikiPageWikiLink Savitchs_theorem.
- St-connectivity wikiPageWikiLinkText "''st''-connectivity".
- St-connectivity wikiPageWikiLinkText "-connectivity".
- St-connectivity wikiPageWikiLinkText "STCON".
- St-connectivity wikiPageWikiLinkText "St-connectivity".
- St-connectivity wikiPageWikiLinkText "st-connectivity".
- St-connectivity wikiPageUsesTemplate Template:Citation.
- St-connectivity wikiPageUsesTemplate Template:Harv.
- St-connectivity wikiPageUsesTemplate Template:Lowercase.
- St-connectivity subject Category:Directed_graphs.
- St-connectivity subject Category:Graph_connectivity.
- St-connectivity subject Category:NL-complete_problems.
- St-connectivity hypernym Asking.
- St-connectivity type Graph.
- St-connectivity type Invariant.
- St-connectivity type Redirect.
- St-connectivity comment "In computer science and computational complexity theory, st-connectivity or STCON 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 byPATH = {〈D, s, t〉 | D is a directed graph with a path from vertex s to t}.".
- St-connectivity label "St-connectivity".
- St-connectivity sameAs Q1361537.
- St-connectivity sameAs Erreichbarkeitsproblem_in_Graphen.
- St-connectivity sameAs Conectividade_st.
- St-connectivity sameAs m.085m2j.
- St-connectivity sameAs Q1361537.
- St-connectivity wasDerivedFrom St-connectivity?oldid=685348497.
- St-connectivity isPrimaryTopicOf St-connectivity.