Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Strongly_connected_component> ?p ?o }
Showing triples 1 to 44 of
44
with 100 triples per page.
- Strongly_connected_component abstract "In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of an arbitrary directed graph form a partition into subgraphs that are themselves strongly connected. It is possible to test the strong connectivity of a graph, or to find its strongly connected components, in linear time.".
- Strongly_connected_component thumbnail Scc.png?width=300.
- Strongly_connected_component wikiPageExternalLink jbpt.
- Strongly_connected_component wikiPageID "684680".
- Strongly_connected_component wikiPageRevisionID "603008280".
- Strongly_connected_component hasPhotoCollection Strongly_connected_component.
- Strongly_connected_component subject Category:Directed_graphs.
- Strongly_connected_component subject Category:Graph_algorithms.
- Strongly_connected_component subject Category:Graph_connectivity.
- Strongly_connected_component type Abstraction100002137.
- Strongly_connected_component type Act100030358.
- Strongly_connected_component type Activity100407535.
- Strongly_connected_component type Algorithm105847438.
- Strongly_connected_component type Communication100033020.
- Strongly_connected_component type DirectedGraphs.
- Strongly_connected_component type Event100029378.
- Strongly_connected_component type Graph107000195.
- Strongly_connected_component type GraphAlgorithms.
- Strongly_connected_component type Procedure101023820.
- Strongly_connected_component type PsychologicalFeature100023100.
- Strongly_connected_component type Rule105846932.
- Strongly_connected_component type VisualCommunication106873252.
- Strongly_connected_component type YagoPermanentlyLocatedEntity.
- Strongly_connected_component comment "In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of an arbitrary directed graph form a partition into subgraphs that are themselves strongly connected. It is possible to test the strong connectivity of a graph, or to find its strongly connected components, in linear time.".
- Strongly_connected_component label "Componente fortemente connessa".
- Strongly_connected_component label "Componente fuertemente conexo".
- Strongly_connected_component label "Composante fortement connexe".
- Strongly_connected_component label "Składowa silnie spójna".
- Strongly_connected_component label "Strongly connected component".
- Strongly_connected_component label "Компонента сильной связности в орграфе".
- Strongly_connected_component label "مخطط قوي التوصيل".
- Strongly_connected_component label "强连通分量".
- Strongly_connected_component sameAs Silně_souvislá_komponenta.
- Strongly_connected_component sameAs Componente_fuertemente_conexo.
- Strongly_connected_component sameAs Composante_fortement_connexe.
- Strongly_connected_component sameAs Componente_fortemente_connessa.
- Strongly_connected_component sameAs Składowa_silnie_spójna.
- Strongly_connected_component sameAs m.032s7z.
- Strongly_connected_component sameAs Q2003238.
- Strongly_connected_component sameAs Q2003238.
- Strongly_connected_component sameAs Strongly_connected_component.
- Strongly_connected_component wasDerivedFrom Strongly_connected_component?oldid=603008280.
- Strongly_connected_component depiction Scc.png.
- Strongly_connected_component isPrimaryTopicOf Strongly_connected_component.