Browse Wiki & Semantic Web

Jump to: navigation, search
Http://dbpedia.org/resource/Category:Computational problems in graph theory
  This page has no properties.
hide properties that link here 
  No properties link to this page.
 
http://dbpedia.org/resource/Category:Computational_problems_in_graph_theory
http://dbpedia.org/ontology/wikiPageID 25346631
http://dbpedia.org/ontology/wikiPageRevisionID 1069815539
http://www.w3.org/2004/02/skos/core#broader http://dbpedia.org/resource/Category:Computational_problems + , http://dbpedia.org/resource/Category:Computational_mathematics + , http://dbpedia.org/resource/Category:Graph_theory +
http://www.w3.org/2004/02/skos/core#prefLabel Computational problems in graph theory
http://www.w3.org/ns/prov#wasDerivedFrom http://en.wikipedia.org/wiki/Category:Computational_problems_in_graph_theory?oldid=1069815539&ns=14 +
owl:sameAs http://dbpedia.org/resource/Category:Computational_problems_in_graph_theory +
rdf:type http://www.w3.org/2004/02/skos/core#Concept +
rdfs:label Computational problems in graph theory
hide properties that link here 
http://dbpedia.org/resource/Shortest_path_problem + , http://dbpedia.org/resource/Connected_dominating_set + , http://dbpedia.org/resource/Clique_cover + , http://dbpedia.org/resource/Planarity_testing + , http://dbpedia.org/resource/K_shortest_path_routing + , http://dbpedia.org/resource/Planted_clique + , http://dbpedia.org/resource/Network_simplex_algorithm + , http://dbpedia.org/resource/Graph_cut_optimization + , http://dbpedia.org/resource/Maximum_agreement_subtree_problem + , http://dbpedia.org/resource/Maximum_weight_matching + , http://dbpedia.org/resource/Graph_sandwich_problem + , http://dbpedia.org/resource/Subgraph_isomorphism_problem + , http://dbpedia.org/resource/Edge_dominating_set + , http://dbpedia.org/resource/Deterministic_rendezvous_problem + , http://dbpedia.org/resource/Widest_path_problem + , http://dbpedia.org/resource/Odd_cycle_transversal + , http://dbpedia.org/resource/Hamiltonian_cycle_polynomial + , http://dbpedia.org/resource/Graph_realization_problem + , http://dbpedia.org/resource/Strong_connectivity_augmentation + , http://dbpedia.org/resource/Wiener_connector + , http://dbpedia.org/resource/Maximal_independent_set + , http://dbpedia.org/resource/Metric_k-center + , http://dbpedia.org/resource/Graph_matching + , http://dbpedia.org/resource/Frequent_subtree_mining + , http://dbpedia.org/resource/Quadratic_pseudo-Boolean_optimization + , http://dbpedia.org/resource/Seidel%27s_algorithm + , http://dbpedia.org/resource/Clique_problem + , http://dbpedia.org/resource/Matching_%28graph_theory%29 + , http://dbpedia.org/resource/Travelling_salesman_problem + , http://dbpedia.org/resource/Graph_coloring + , http://dbpedia.org/resource/Independent_set_%28graph_theory%29 + , http://dbpedia.org/resource/Vertex_cover + , http://dbpedia.org/resource/Maximum_cut + , http://dbpedia.org/resource/Induced_subgraph_isomorphism_problem + , http://dbpedia.org/resource/MaxDDBS + , http://dbpedia.org/resource/Minimum_k-cut + , http://dbpedia.org/resource/Longest_uncrossed_knight%27s_path + , http://dbpedia.org/resource/Maximum_common_induced_subgraph + , http://dbpedia.org/resource/Nondeterministic_constraint_logic + , http://dbpedia.org/resource/Degree_diameter_problem + , http://dbpedia.org/resource/Multi-trials_technique + , http://dbpedia.org/resource/Graph_cuts_in_computer_vision + , http://dbpedia.org/resource/Correlation_clustering + , http://dbpedia.org/resource/Maximum_flow_problem + , http://dbpedia.org/resource/Canadian_traveller_problem + , http://dbpedia.org/resource/Dominating_set + , http://dbpedia.org/resource/Edge_cover + , http://dbpedia.org/resource/Nonblocker + , http://dbpedia.org/resource/Pebble_motion_problems + , http://dbpedia.org/resource/Vertex_cycle_cover + , http://dbpedia.org/resource/Snake-in-the-box + , http://dbpedia.org/resource/Digraph_realization_problem + , http://dbpedia.org/resource/Bipartite_realization_problem + , http://dbpedia.org/resource/Maximum_common_edge_subgraph + , http://dbpedia.org/resource/Mixed_Chinese_postman_problem + , http://dbpedia.org/resource/Spanning_tree + , http://dbpedia.org/resource/Facility_location_problem + , http://dbpedia.org/resource/Graph_partition + , http://dbpedia.org/resource/Longest_path_problem + , http://dbpedia.org/resource/Feedback_arc_set + , http://dbpedia.org/resource/Steiner_tree_problem + , http://dbpedia.org/resource/Radio_coloring + , http://dbpedia.org/resource/Chinese_postman_problem + , http://dbpedia.org/resource/Feedback_vertex_set + , http://dbpedia.org/resource/Hamiltonian_path_problem + , http://dbpedia.org/resource/Good_spanning_tree + , http://dbpedia.org/resource/Graph_edit_distance + , http://dbpedia.org/resource/Hamiltonian_path + , http://dbpedia.org/resource/Graph_isomorphism_problem + , http://dbpedia.org/resource/Instant_Insanity + , http://dbpedia.org/resource/Set_TSP_problem + , http://dbpedia.org/resource/Domatic_number + http://dbpedia.org/ontology/wikiPageWikiLink
http://dbpedia.org/resource/Shortest_path_problem + , http://dbpedia.org/resource/Connected_dominating_set + , http://dbpedia.org/resource/Clique_cover + , http://dbpedia.org/resource/Planarity_testing + , http://dbpedia.org/resource/K_shortest_path_routing + , http://dbpedia.org/resource/Planted_clique + , http://dbpedia.org/resource/Network_simplex_algorithm + , http://dbpedia.org/resource/Graph_cut_optimization + , http://dbpedia.org/resource/Maximum_agreement_subtree_problem + , http://dbpedia.org/resource/Maximum_weight_matching + , http://dbpedia.org/resource/Graph_sandwich_problem + , http://dbpedia.org/resource/Subgraph_isomorphism_problem + , http://dbpedia.org/resource/Edge_dominating_set + , http://dbpedia.org/resource/Deterministic_rendezvous_problem + , http://dbpedia.org/resource/Widest_path_problem + , http://dbpedia.org/resource/Odd_cycle_transversal + , http://dbpedia.org/resource/Hamiltonian_cycle_polynomial + , http://dbpedia.org/resource/Graph_realization_problem + , http://dbpedia.org/resource/Strong_connectivity_augmentation + , http://dbpedia.org/resource/Wiener_connector + , http://dbpedia.org/resource/Maximal_independent_set + , http://dbpedia.org/resource/Metric_k-center + , http://dbpedia.org/resource/Graph_matching + , http://dbpedia.org/resource/Frequent_subtree_mining + , http://dbpedia.org/resource/Quadratic_pseudo-Boolean_optimization + , http://dbpedia.org/resource/Seidel%27s_algorithm + , http://dbpedia.org/resource/Clique_problem + , http://dbpedia.org/resource/Matching_%28graph_theory%29 + , http://dbpedia.org/resource/Travelling_salesman_problem + , http://dbpedia.org/resource/Graph_coloring + , http://dbpedia.org/resource/Independent_set_%28graph_theory%29 + , http://dbpedia.org/resource/Vertex_cover + , http://dbpedia.org/resource/Maximum_cut + , http://dbpedia.org/resource/Induced_subgraph_isomorphism_problem + , http://dbpedia.org/resource/MaxDDBS + , http://dbpedia.org/resource/Minimum_k-cut + , http://dbpedia.org/resource/Longest_uncrossed_knight%27s_path + , http://dbpedia.org/resource/Maximum_common_induced_subgraph + , http://dbpedia.org/resource/Nondeterministic_constraint_logic + , http://dbpedia.org/resource/Degree_diameter_problem + , http://dbpedia.org/resource/Multi-trials_technique + , http://dbpedia.org/resource/Graph_cuts_in_computer_vision + , http://dbpedia.org/resource/Correlation_clustering + , http://dbpedia.org/resource/Maximum_flow_problem + , http://dbpedia.org/resource/Canadian_traveller_problem + , http://dbpedia.org/resource/Dominating_set + , http://dbpedia.org/resource/Edge_cover + , http://dbpedia.org/resource/Nonblocker + , http://dbpedia.org/resource/Pebble_motion_problems + , http://dbpedia.org/resource/Vertex_cycle_cover + , http://dbpedia.org/resource/Snake-in-the-box + , http://dbpedia.org/resource/Digraph_realization_problem + , http://dbpedia.org/resource/Bipartite_realization_problem + , http://dbpedia.org/resource/Maximum_common_edge_subgraph + , http://dbpedia.org/resource/Mixed_Chinese_postman_problem + , http://dbpedia.org/resource/Spanning_tree + , http://dbpedia.org/resource/Facility_location_problem + , http://dbpedia.org/resource/Graph_partition + , http://dbpedia.org/resource/Longest_path_problem + , http://dbpedia.org/resource/Feedback_arc_set + , http://dbpedia.org/resource/Steiner_tree_problem + , http://dbpedia.org/resource/Radio_coloring + , http://dbpedia.org/resource/Chinese_postman_problem + , http://dbpedia.org/resource/Feedback_vertex_set + , http://dbpedia.org/resource/Hamiltonian_path_problem + , http://dbpedia.org/resource/Good_spanning_tree + , http://dbpedia.org/resource/Graph_edit_distance + , http://dbpedia.org/resource/Hamiltonian_path + , http://dbpedia.org/resource/Graph_isomorphism_problem + , http://dbpedia.org/resource/Instant_Insanity + , http://dbpedia.org/resource/Set_TSP_problem + , http://dbpedia.org/resource/Domatic_number + , http://dbpedia.org/resource/Token_reconfiguration + http://purl.org/dc/terms/subject
http://dbpedia.org/resource/Category:Graph_algorithms + , http://dbpedia.org/resource/Category:Spanning_tree + , http://dbpedia.org/resource/Category:Network_flow_problem + , http://dbpedia.org/resource/Category:Travelling_salesman_problem + http://www.w3.org/2004/02/skos/core#broader
http://dbpedia.org/resource/Category:Computational_problems_in_graph_theory + owl:sameAs
 

 

Enter the name of the page to start semantic browsing from.
Retrieved from "http://b-kaempgen.de/index.php/Special:BrowseSW/http:-2F-2Fdbpedia.org-2Fresource-2FCategory:Computational_problems_in_graph_theory"