CaLiGraph
Formats
RDF
N-Triples
N3/Turtle
JSON
XML
CSV
OData
Atom
JSON
Microdata
JSON
HTML
Embedded
JSON
Turtle
Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
LODmilla Browser
Sparql Endpoint
About:
clgo:
Computational_problem_in_graph_theory
Property
Value
rdf:
type
owl:
Class
rdfs:
label
Computational problem in graph theory
rdfs:
subClassOf
Computational problem
prov:
wasDerivedFrom
http://en.wikipedia.org/wiki/Category:Computational_problems_in_graph_theory
is
rdf:
type
of
maximum independent set problem
Maximum common edge subgraph
Graph realization problem
Token reconfiguration
Frequent subtree mining
Quadratic pseudo-Boolean optimization
Degree diameter problem
Induced subgraph isomorphism problem
Nonblocker
Seidel's algorithm
Odd cycle transversal
Graph coloring
Graph cuts in computer vision
Strong connectivity augmentation
Graph matching
Correlation clustering
Maximum agreement subtree problem
Network simplex algorithm
Wiener connector
Snake-in-the-box
Maximal independent set
Dominating set
Longest uncrossed knight's path
Steiner tree problem
Pebble motion problems
Widest path problem
Clique problem
Graph partition
Hamiltonian path problem
Clique cover
Matching (graph theory)
Graph edit distance
Maximum common induced subgraph
Instant Insanity
Nondeterministic constraint logic
Subgraph isomorphism problem
Route inspection problem
Canadian traveller problem
Graph cut optimization
Feedback arc set
Hamiltonian cycle polynomial
Maximum flow problem
Shortest path problem
Facility location problem
Multi-trials technique
MaxDDBS
Good spanning tree
token reconfiguration problem
Graph sandwich problem
Hamiltonian path
Maximum cut
K shortest path routing
Set TSP problem
Spanning tree
Edge dominating set
Maximum weight matching
Graph isomorphism problem
Planted clique
Minimum k-cut
Vertex cover
Deterministic rendezvous problem
Feedback vertex set
Connected dominating set
Domatic number
Longest path problem
Planarity testing
Radio coloring
Travelling salesman problem
Vertex cycle cover
Edge cover
Metric k-center
Digraph realization problem
Bipartite realization problem
Independent set (graph theory)