Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Path-based_strong_component_algorithm> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Path-based_strong_component_algorithm abstract "In graph theory, the strongly connected components of a directed graph may be found using an algorithm that uses depth-first search in combination with two stacks, one to keep track of the vertices in the current component and the second to keep track of the current search path. Versions of this algorithm have been proposed by Purdom (1970), Munro (1971), Dijkstra (1976), Cheriyan & Mehlhorn (1996), and Gabow (2000); of these, Dijkstra's version was the first to achieve linear time.".
- Path-based_strong_component_algorithm wikiPageID "12377419".
- Path-based_strong_component_algorithm wikiPageRevisionID "544876206".
- Path-based_strong_component_algorithm hasPhotoCollection Path-based_strong_component_algorithm.
- Path-based_strong_component_algorithm subject Category:Graph_algorithms.
- Path-based_strong_component_algorithm subject Category:Graph_connectivity.
- Path-based_strong_component_algorithm type Abstraction100002137.
- Path-based_strong_component_algorithm type Act100030358.
- Path-based_strong_component_algorithm type Activity100407535.
- Path-based_strong_component_algorithm type Algorithm105847438.
- Path-based_strong_component_algorithm type Event100029378.
- Path-based_strong_component_algorithm type GraphAlgorithms.
- Path-based_strong_component_algorithm type Procedure101023820.
- Path-based_strong_component_algorithm type PsychologicalFeature100023100.
- Path-based_strong_component_algorithm type Rule105846932.
- Path-based_strong_component_algorithm type YagoPermanentlyLocatedEntity.
- Path-based_strong_component_algorithm comment "In graph theory, the strongly connected components of a directed graph may be found using an algorithm that uses depth-first search in combination with two stacks, one to keep track of the vertices in the current component and the second to keep track of the current search path. Versions of this algorithm have been proposed by Purdom (1970), Munro (1971), Dijkstra (1976), Cheriyan & Mehlhorn (1996), and Gabow (2000); of these, Dijkstra's version was the first to achieve linear time.".
- Path-based_strong_component_algorithm label "Path-based strong component algorithm".
- Path-based_strong_component_algorithm sameAs m.02w1y2y.
- Path-based_strong_component_algorithm sameAs Q7144620.
- Path-based_strong_component_algorithm sameAs Q7144620.
- Path-based_strong_component_algorithm sameAs Path-based_strong_component_algorithm.
- Path-based_strong_component_algorithm wasDerivedFrom Path-based_strong_component_algorithm?oldid=544876206.
- Path-based_strong_component_algorithm isPrimaryTopicOf Path-based_strong_component_algorithm.