About: Computational problems in graph theory

Property	Value
dbo:wikiPageID	25346631 (xsd:integer)
dbo:wikiPageRevisionID	1069815539 (xsd:integer)
rdf:type	skos:Concept
rdfs:label	Computational problems in graph theory (en)
skos:broader	dbc:Computational_mathematics dbc:Computational_problems dbc:Graph_theory
skos:prefLabel	Computational problems in graph theory (en)
prov:wasDerivedFrom	wikipedia-en:Category:Computational_problems_in_graph_theory?oldid=1069815539&ns=14
is dbo:wikiPageWikiLink of	dbr:Metric_k-center dbr:Vertex_cover dbr:Degree_diameter_problem dbr:Deterministic_rendezvous_problem dbr:Independent_set_(graph_theory) dbr:Induced_subgraph_isomorphism_problem dbr:Instant_Insanity dbr:Pebble_motion_problems dbr:Matching_(graph_theory) dbr:Maximal_independent_set dbr:Maximum_cut dbr:Maximum_flow_problem dbr:Odd_cycle_transversal dbr:Token_reconfiguration dbr:Quadratic_pseudo-Boolean_optimization dbr:Radio_coloring dbr:Clique_problem dbr:Graph_coloring dbr:Connected_dominating_set dbr:Correlation_clustering dbr:Chinese_postman_problem dbr:Shortest_path_problem dbr:Snake-in-the-box dbr:Steiner_tree_problem dbr:Clique_cover dbr:Feedback_arc_set dbr:Feedback_vertex_set dbr:Hamiltonian_cycle_polynomial dbr:Hamiltonian_path_problem dbr:Spanning_tree dbr:MaxDDBS dbr:Maximum_agreement_subtree_problem dbr:Maximum_common_edge_subgraph dbr:Maximum_common_induced_subgraph dbr:Maximum_weight_matching dbr:Travelling_salesman_problem dbr:Widest_path_problem dbr:Domatic_number dbr:Network_simplex_algorithm dbr:Minimum_k-cut dbr:Digraph_realization_problem dbr:Good_spanning_tree dbr:Graph_cut_optimization dbr:Graph_cuts_in_computer_vision dbr:Graph_edit_distance dbr:Graph_isomorphism_problem dbr:Graph_matching dbr:Graph_partition dbr:Graph_realization_problem dbr:Graph_sandwich_problem dbr:K_shortest_path_routing dbr:Vertex_cycle_cover dbr:Hamiltonian_path dbr:Multi-trials_technique dbr:Wiener_connector dbr:Bipartite_realization_problem dbr:Edge_cover dbr:Edge_dominating_set dbr:Dominating_set dbr:Frequent_subtree_mining dbr:Canadian_traveller_problem dbr:Longest_path_problem dbr:Longest_uncrossed_knight's_path dbr:Mixed_Chinese_postman_problem dbr:Facility_location_problem dbr:Set_TSP_problem dbr:Planarity_testing dbr:Planted_clique dbr:Subgraph_isomorphism_problem dbr:Seidel's_algorithm dbr:Nonblocker dbr:Nondeterministic_constraint_logic dbr:Strong_connectivity_augmentation
is dcterms:subject of	dbr:Metric_k-center dbr:Vertex_cover dbr:Degree_diameter_problem dbr:Deterministic_rendezvous_problem dbr:Independent_set_(graph_theory) dbr:Induced_subgraph_isomorphism_problem dbr:Instant_Insanity dbr:Pebble_motion_problems dbr:Matching_(graph_theory) dbr:Maximal_independent_set dbr:Maximum_cut dbr:Maximum_flow_problem dbr:Odd_cycle_transversal dbr:Token_reconfiguration dbr:Quadratic_pseudo-Boolean_optimization dbr:Radio_coloring dbr:Clique_problem dbr:Graph_coloring dbr:Connected_dominating_set dbr:Correlation_clustering dbr:Chinese_postman_problem dbr:Shortest_path_problem dbr:Snake-in-the-box dbr:Steiner_tree_problem dbr:Clique_cover dbr:Feedback_arc_set dbr:Feedback_vertex_set dbr:Hamiltonian_cycle_polynomial dbr:Hamiltonian_path_problem dbr:Spanning_tree dbr:MaxDDBS dbr:Maximum_agreement_subtree_problem dbr:Maximum_common_edge_subgraph dbr:Maximum_common_induced_subgraph dbr:Maximum_weight_matching dbr:Travelling_salesman_problem dbr:Widest_path_problem dbr:Domatic_number dbr:Network_simplex_algorithm dbr:Minimum_k-cut dbr:Digraph_realization_problem dbr:Good_spanning_tree dbr:Graph_cut_optimization dbr:Graph_cuts_in_computer_vision dbr:Graph_edit_distance dbr:Graph_isomorphism_problem dbr:Graph_matching dbr:Graph_partition dbr:Graph_realization_problem dbr:Graph_sandwich_problem dbr:K_shortest_path_routing dbr:Vertex_cycle_cover dbr:Hamiltonian_path dbr:Multi-trials_technique dbr:Wiener_connector dbr:Bipartite_realization_problem dbr:Edge_cover dbr:Edge_dominating_set dbr:Dominating_set dbr:Frequent_subtree_mining dbr:Canadian_traveller_problem dbr:Longest_path_problem dbr:Longest_uncrossed_knight's_path dbr:Mixed_Chinese_postman_problem dbr:Facility_location_problem dbr:Set_TSP_problem dbr:Planarity_testing dbr:Planted_clique dbr:Subgraph_isomorphism_problem dbr:Seidel's_algorithm dbr:Nonblocker dbr:Nondeterministic_constraint_logic dbr:Strong_connectivity_augmentation
is skos:broader of	dbc:Network_flow_problem dbc:Spanning_tree dbc:Graph_algorithms dbc:Travelling_salesman_problem