Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Path-based_strong_component_algorithm> ?p ?o }
Showing triples 1 to 38 of
38
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 wikiPageLength "4498".
- Path-based_strong_component_algorithm wikiPageOutDegree "12".
- Path-based_strong_component_algorithm wikiPageRevisionID "610043696".
- Path-based_strong_component_algorithm wikiPageWikiLink Algorithmica.
- Path-based_strong_component_algorithm wikiPageWikiLink Array_(data_type).
- Path-based_strong_component_algorithm wikiPageWikiLink Array_data_type.
- Path-based_strong_component_algorithm wikiPageWikiLink Category:Graph_algorithms.
- Path-based_strong_component_algorithm wikiPageWikiLink Category:Graph_connectivity.
- Path-based_strong_component_algorithm wikiPageWikiLink Depth-first_search.
- Path-based_strong_component_algorithm wikiPageWikiLink Directed_graph.
- Path-based_strong_component_algorithm wikiPageWikiLink Graph_theory.
- Path-based_strong_component_algorithm wikiPageWikiLink Linear_time.
- Path-based_strong_component_algorithm wikiPageWikiLink Stack_(abstract_data_type).
- Path-based_strong_component_algorithm wikiPageWikiLink Stack_(data_structure).
- Path-based_strong_component_algorithm wikiPageWikiLink Strongly_connected_component.
- Path-based_strong_component_algorithm wikiPageWikiLink Tarjans_strongly_connected_components_algorithm.
- Path-based_strong_component_algorithm wikiPageWikiLink Time_complexity.
- Path-based_strong_component_algorithm wikiPageWikiLinkText "Path-based strong component algorithm".
- Path-based_strong_component_algorithm wikiPageWikiLinkText "path-based strong component algorithm".
- Path-based_strong_component_algorithm hasPhotoCollection Path-based_strong_component_algorithm.
- Path-based_strong_component_algorithm wikiPageUsesTemplate Template:Citation.
- Path-based_strong_component_algorithm wikiPageUsesTemplate Template:Harvtxt.
- Path-based_strong_component_algorithm wikiPageUsesTemplate Template:Reflist.
- Path-based_strong_component_algorithm subject Category:Graph_algorithms.
- Path-based_strong_component_algorithm subject Category:Graph_connectivity.
- Path-based_strong_component_algorithm type Algorithm.
- Path-based_strong_component_algorithm type Invariant.
- 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 الگوریتم_مؤلفه_قوی_مبتنی_بر_مسیر.
- Path-based_strong_component_algorithm sameAs m.02w1y2y.
- Path-based_strong_component_algorithm sameAs Алгоритам_за_налажење_компоненти_повезаности.
- Path-based_strong_component_algorithm sameAs Q7144620.
- Path-based_strong_component_algorithm sameAs Q7144620.
- Path-based_strong_component_algorithm wasDerivedFrom Path-based_strong_component_algorithm?oldid=610043696.
- Path-based_strong_component_algorithm isPrimaryTopicOf Path-based_strong_component_algorithm.