Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
http://dbpedia.org/class/yago/WikicatComputationalProblemsInGraphTheory
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Property
Value
rdfs:
subClassOf
yago
:Problem114410605
owl:
equivalentClass
yago-res
:wikicat_Computational_problems_in_graph_theory
is
rdf:
type
of
dbr
:Route_inspection_problem
dbr
:Metric_k-center
dbr
:Vehicle_routing_problem
dbr
:Vertex_cover
dbr
:Degree_diameter_problem
dbr
:Independent_set_(graph_theory)
dbr
:Induced_subgraph_isomorphism_problem
dbr
:Instant_Insanity
dbr
:Maximal_independent_set
dbr
:Maximum_cut
dbr
:Clique_problem
dbr
:Graph_coloring
dbr
:Connected_dominating_set
dbr
:Correlation_clustering
dbr
:METIS
dbr
:Shortest_path_problem
dbr
:Snake-in-the-box
dbr
:Steiner_tree_problem
dbr
:Feedback_arc_set
dbr
:Feedback_vertex_set
dbr
:Clique_cover_problem
dbr
:Hamiltonian_path_problem
dbr
:MaxDDBS
dbr
:Travelling_salesman_problem
dbr
:Widest_path_problem
dbr
:Domatic_number
dbr
:Minimum_k-cut
dbr
:Graph_cuts_in_computer_vision
dbr
:Graph_isomorphism_problem
dbr
:Graph_partition
dbr
:Graph_sandwich_problem
dbr
:K_shortest_path_routing
dbr
:Knight's_tour
dbr
:Vertex_cycle_cover
dbr
:Hamiltonian_path
dbr
:Multi-trials_technique
dbr
:Maximum_common_subgraph_isomorphism_problem
dbr
:Edge_cover
dbr
:Edge_dominating_set
dbr
:Dominating_set
dbr
:Assignment_problem
dbr
:St-connectivity
dbr
:Canadian_traveller_problem
dbr
:Longest_path_problem
dbr
:Longest_uncrossed_knight's_path
dbr
:Seven_Bridges_of_Königsberg
dbr
:Set_TSP_problem
dbr
:Planarity_testing
dbr
:Subgraph_isomorphism_problem
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 3.0 Unported License