Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Reachability
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Whether one vertex can be reached from another in a graph
Property
Value
dbo:
description
egy gráf egyik csúcsa elérhető-e a másikból
(hu)
ob ein Knoten von einem anderen im Graph erreicht werden kann
(de)
whether one vertex can be reached from another in a graph
(en)
se se pode atinxir un vértice desde outro nun grafo
(gl)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Graph_suitable_for_Kameda's_method.svg?width=300
dbo:
wikiPageWikiLink
dbr
:Glossary_of_graph_theory
dbr
:Cycle_(graph_theory)
dbr
:Floyd–Warshall_algorithm
dbc
:Graph_connectivity
dbr
:St-connectivity
dbr
:Path_(graph_theory)
dbr
:Preorder
dbr
:Directed_graph
dbr
:Transitive_closure
dbr
:Directed_acyclic_graph
dbr
:Vertex_(graph_theory)
dbr
:Graph_theory
dbr
:Transitive_reduction
dbr
:Connected_component_(graph_theory)
dbr
:Partial_order
dbr
:Mikkel_Thorup
dbr
:Garbage_collection_(computer_science)
dbr
:Planar_graph
dbr
:Iterative_deepening_depth-first_search
dbr
:Gammoid
dbr
:Relation_(mathematics)
dbr
:Linear_time
dbr
:Iff
dbr
:Breadth_first_search
dbr
:Planar_Graph
dbr
:Planar_Separator_Theorem
dbr
:Data_pre-processing
dbr
:File:Graph_suitable_for_Kameda's_method.svg
dbr
:File:Kameda's_algorithm_run.svg
dbp:
wikiPageUsesTemplate
dbt
:Reflist
dbt
:Short_description
dct:
subject
dbc
:Graph_connectivity
rdfs:
label
Reachability
(en)
도달성
(ko)
Atingibilidade (teoria dos grafos)
(pt)
Osiągalność (teoria grafów)
(pl)
Достижимость
(ru)
owl:
sameAs
freebase
:Reachability
wikidata
:Reachability
dbpedia-pt
:Reachability
dbpedia-hu
:Reachability
dbpedia-ru
:Reachability
dbpedia-pl
:Reachability
dbpedia-ko
:Reachability
dbpedia-global
:Reachability
prov:
wasDerivedFrom
wikipedia-en
:Reachability?oldid=1162008317&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Graph_suitable_for_Kameda's_method.svg
wiki-commons
:Special:FilePath/Kameda's_algorithm_run.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Reachability
is
dbo:
wikiPageDisambiguates
of
dbr
:Reach
is
dbo:
wikiPageRedirects
of
dbr
:Reachability_matrix
dbr
:Graph_reachability
dbr
:Thorup's_algorithm
dbr
:Kameda's_algorithm
dbr
:Reachable
is
dbo:
wikiPageWikiLink
of
dbr
:Graph_drawing
dbr
:Backbone_network
dbr
:Upward_planar_drawing
dbr
:NL_(complexity)
dbr
:A*_search_algorithm
dbr
:Glossary_of_graph_theory
dbr
:Controlling_for_a_variable
dbr
:Rooted_graph
dbr
:Stochastic_Petri_net
dbr
:Reachability_matrix
dbr
:St-connectivity
dbr
:Preorder
dbr
:Matroid_partitioning
dbr
:Matroid_representation
dbr
:Transitive_closure
dbr
:Tournament_(graph_theory)
dbr
:Directed_acyclic_graph
dbr
:L_(complexity)
dbr
:CPAchecker
dbr
:Implicit_graph
dbr
:Reach
dbr
:Transitive_reduction
dbr
:Coffman–Graham_algorithm
dbr
:Strongly_connected_component
dbr
:Polytree
dbr
:Underhanded_C_Contest
dbr
:Partially_ordered_set
dbr
:Topological_sorting
dbr
:P_(complexity)
dbr
:Component_(graph_theory)
dbr
:Argus_–_Audit_Record_Generation_and_Utilization_System
dbr
:JGRASP
dbr
:Mirsky's_theorem
dbr
:Multitree
dbr
:Second-order_logic
dbr
:Control-flow_graph
dbr
:Configuration_graph
dbr
:Book_embedding
dbr
:Hybrid_automaton
dbr
:Heartbeat_(computing)
dbr
:Hierarchical_and_recursive_queries_in_SQL
dbr
:Maria_(reachability_analyzer)
dbr
:Series-parallel_partial_order
dbr
:Cycle_detection
dbr
:Reconfiguration
dbr
:Dominance_drawing
dbr
:Weak_component
dbr
:Graph_reachability
dbr
:Thorup's_algorithm
dbr
:Kameda's_algorithm
dbr
:Reachable
is
foaf:
primaryTopic
of
wikipedia-en
:Reachability
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International