About: Graph algorithms

Property	Value
dbo:wikiPageID	699287 (xsd:integer)
dbo:wikiPageRevisionID	1083738949 (xsd:integer)
dbp:wikiPageUsesTemplate	dbt:Commons_category dbt:CatAutoTOC dbt:Cat_main_section
rdf:type	skos:Concept
rdfs:label	Graph algorithms (en)
skos:broader	dbc:Combinatorial_algorithms dbc:Algorithms dbc:Computational_problems_in_graph_theory
skos:prefLabel	Graph algorithms (en)
prov:wasDerivedFrom	wikipedia-en:Category:Graph_algorithms?oldid=1083738949&ns=14
is dbo:wikiPageWikiLink of	dbr:Belief_propagation dbr:Prim's_algorithm dbr:Push–relabel_maximum_flow_algorithm dbr:Spectral_layout dbr:Bellman–Ford_algorithm dbr:Bianconi–Barabási_model dbr:Blossom_algorithm dbr:Degeneracy_(graph_theory) dbr:Aperiodic_graph dbr:Reverse-delete_algorithm dbr:Cuthill–McKee_algorithm dbr:D* dbr:DSatur dbr:Depth-first_search dbr:Double_pushout_graph_rewriting dbr:Dulmage–Mendelsohn_decomposition dbr:Dynamic_connectivity dbr:Dynamic_link_matching dbr:Initial_attractiveness dbr:LASCNN_algorithm dbr:Lexicographic_breadth-first_search dbr:Pre-topological_order dbr:Color-coding dbr:Network_flow_problem dbr:Zero-weight_cycle_problem dbr:Fringe_search dbr:Gomory–Hu_tree dbr:Graph_bandwidth dbr:Bottleneck_traveling_salesman_problem dbr:Contraction_hierarchies dbr:Theta* dbr:METIS dbr:Clique_percolation_method dbr:Closure_problem dbr:Colour_refinement_algorithm dbr:Hopcroft–Karp_algorithm dbr:Kruskal's_algorithm dbr:MaxCliqueDyn_maximum_clique_algorithm dbr:Topological_sorting dbr:Transitive_closure dbr:Travelling_salesman_problem dbr:Tree_traversal dbr:Widest_path_problem dbr:Disparity_filter_algorithm_of_weighted_network dbr:Gallai–Edmonds_decomposition dbr:Girvan–Newman_algorithm dbr:HCS_clustering_algorithm dbr:Havel–Hakimi_algorithm dbr:Johnson's_algorithm dbr:Jump_point_search dbr:Junction_tree_algorithm dbr:Karger's_algorithm dbr:Link_prediction dbr:Network_simplex_algorithm dbr:Spreading_activation dbr:Transitive_reduction dbr:A_search_algorithm dbr:Alpha–beta_pruning dbr:Barabási–Albert_model dbr:Breadth-first_search dbr:Bron–Kerbosch_algorithm dbr:PageRank dbr:Parallel_all-pairs_shortest_path_algorithm dbr:Centrality dbr:Dijkstra–Scholten_algorithm dbr:Dinic's_algorithm dbr:Edmonds'_algorithm dbr:Edmonds–Karp_algorithm dbr:Floyd–Warshall_algorithm dbr:Force-directed_graph_drawing dbr:Ford–Fulkerson_algorithm dbr:Goal_node_(computer_science) dbr:Graph_edit_distance dbr:Graph_embedding dbr:Graph_isomorphism dbr:Graph_isomorphism_problem dbr:Graph_kernel dbr:Graph_neural_network dbr:Graph_reduction dbr:Graph_traversal dbr:Iterative_compression dbr:Iterative_deepening_A dbr:Journal_of_Graph_Algorithms_and_Applications dbr:KHOPCA_clustering_algorithm dbr:K_shortest_path_routing dbr:Knight's_tour dbr:Knowledge_graph_embedding dbr:Knuth's_Simpath_algorithm dbr:Hall-type_theorems_for_hypergraphs dbr:Iterative_deepening_depth-first_search dbr:Courcelle's_theorem dbr:Wiener_connector dbr:Bidirectional_search dbr:Suurballe's_algorithm dbr:Hierarchical_closeness dbr:Hierarchical_clustering_of_networks dbr:Misra_&_Gries_edge_coloring_algorithm dbr:Tarjan's_strongly_connected_components_algorithm dbr:Recursive_largest_first_algorithm dbr:Dijkstra's_algorithm dbr:B* dbr:Borůvka's_algorithm dbr:Bully_algorithm dbr:Kosaraju's_algorithm dbr:Minimum_bottleneck_spanning_tree dbr:Nearest_neighbour_algorithm dbr:Chaitin's_algorithm dbr:Christofides_algorithm dbr:Kleitman–Wang_algorithms dbr:Longest_path_problem dbr:Minimax dbr:SMA* dbr:Sethi–Ullman_algorithm dbr:Shortest_Path_Faster_Algorithm dbr:Euler_tour_technique dbr:External_memory_graph_traversal dbr:Extremal_Ensemble_Learning dbr:FKT_algorithm dbr:Path-based_strong_component_algorithm dbr:Proof-number_search dbr:Transit_node_routing dbr:Subgraph_isomorphism_problem dbr:Rocha–Thatte_cycle_detection_algorithm dbr:Tarjan's_off-line_lowest_common_ancestors_algorithm dbr:Seidel's_algorithm dbr:Yen's_algorithm dbr:Nonblocking_minimal_spanning_switch dbr:Parallel_breadth-first_search dbr:Stoer–Wagner_algorithm
is dcterms:subject of	dbr:Belief_propagation dbr:Prim's_algorithm dbr:Push–relabel_maximum_flow_algorithm dbr:Spectral_layout dbr:Bellman–Ford_algorithm dbr:Bianconi–Barabási_model dbr:Blossom_algorithm dbr:Degeneracy_(graph_theory) dbr:Aperiodic_graph dbr:Reverse-delete_algorithm dbr:Cuthill–McKee_algorithm dbr:D* dbr:DSatur dbr:Depth-first_search dbr:Double_pushout_graph_rewriting dbr:Dulmage–Mendelsohn_decomposition dbr:Dynamic_connectivity dbr:Dynamic_link_matching dbr:Initial_attractiveness dbr:LASCNN_algorithm dbr:Lexicographic_breadth-first_search dbr:Pre-topological_order dbr:Color-coding dbr:Network_flow_problem dbr:Zero-weight_cycle_problem dbr:Fringe_search dbr:Gomory–Hu_tree dbr:Graph_bandwidth dbr:Bottleneck_traveling_salesman_problem dbr:Contraction_hierarchies dbr:Theta* dbr:METIS dbr:Clique_percolation_method dbr:Closure_problem dbr:Colour_refinement_algorithm dbr:Hopcroft–Karp_algorithm dbr:Kruskal's_algorithm dbr:MaxCliqueDyn_maximum_clique_algorithm dbr:Topological_sorting dbr:Transitive_closure dbr:Travelling_salesman_problem dbr:Tree_traversal dbr:Widest_path_problem dbr:Disparity_filter_algorithm_of_weighted_network dbr:Gallai–Edmonds_decomposition dbr:Girvan–Newman_algorithm dbr:HCS_clustering_algorithm dbr:Havel–Hakimi_algorithm dbr:Johnson's_algorithm dbr:Jump_point_search dbr:Junction_tree_algorithm dbr:Karger's_algorithm dbr:Link_prediction dbr:Network_simplex_algorithm dbr:Spreading_activation dbr:Transitive_reduction dbr:A_search_algorithm dbr:Alpha–beta_pruning dbr:Barabási–Albert_model dbr:Breadth-first_search dbr:Bron–Kerbosch_algorithm dbr:PageRank dbr:Parallel_all-pairs_shortest_path_algorithm dbr:Centrality dbr:Dijkstra–Scholten_algorithm dbr:Dinic's_algorithm dbr:Edmonds'_algorithm dbr:Edmonds–Karp_algorithm dbr:Floyd–Warshall_algorithm dbr:Force-directed_graph_drawing dbr:Ford–Fulkerson_algorithm dbr:Goal_node_(computer_science) dbr:Graph_edit_distance dbr:Graph_embedding dbr:Graph_isomorphism dbr:Graph_isomorphism_problem dbr:Graph_kernel dbr:Graph_neural_network dbr:Graph_reduction dbr:Graph_traversal dbr:Iterative_compression dbr:Iterative_deepening_A dbr:Journal_of_Graph_Algorithms_and_Applications dbr:KHOPCA_clustering_algorithm dbr:K_shortest_path_routing dbr:Knight's_tour dbr:Knowledge_graph_embedding dbr:Knuth's_Simpath_algorithm dbr:Hall-type_theorems_for_hypergraphs dbr:Iterative_deepening_depth-first_search dbr:Courcelle's_theorem dbr:Wiener_connector dbr:Bidirectional_search dbr:Suurballe's_algorithm dbr:Hierarchical_closeness dbr:Hierarchical_clustering_of_networks dbr:Misra_&_Gries_edge_coloring_algorithm dbr:Tarjan's_strongly_connected_components_algorithm dbr:Recursive_largest_first_algorithm dbr:Dijkstra's_algorithm dbr:B* dbr:Borůvka's_algorithm dbr:Bully_algorithm dbr:Kosaraju's_algorithm dbr:Minimum_bottleneck_spanning_tree dbr:Nearest_neighbour_algorithm dbr:Chaitin's_algorithm dbr:Christofides_algorithm dbr:Kleitman–Wang_algorithms dbr:Longest_path_problem dbr:Minimax dbr:SMA* dbr:Sethi–Ullman_algorithm dbr:Shortest_Path_Faster_Algorithm dbr:Euler_tour_technique dbr:External_memory_graph_traversal dbr:Extremal_Ensemble_Learning dbr:FKT_algorithm dbr:Path-based_strong_component_algorithm dbr:Proof-number_search dbr:Transit_node_routing dbr:Subgraph_isomorphism_problem dbr:Rocha–Thatte_cycle_detection_algorithm dbr:Tarjan's_off-line_lowest_common_ancestors_algorithm dbr:Seidel's_algorithm dbr:Yen's_algorithm dbr:Nonblocking_minimal_spanning_switch dbr:Parallel_breadth-first_search dbr:Stoer–Wagner_algorithm
is skos:broader of	dbc:Flooding_algorithms dbc:Graph_drawing dbc:Graph_rewriting