Thanks to visit codestin.com
Credit goes to dbpedia.org
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:
MaxDDBS
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Computational problem in graph theory
Property
Value
dbo:
description
computational problem in graph theory
(en)
dbo:
wikiPageExternalLink
http://combinatoricswiki.org/wiki/The_Maximum_Degree-and-Diameter-Bounded_Subgraph_Problem
dbo:
wikiPageWikiLink
dbc
:Computational_problems_in_graph_theory
dbr
:Graph_theory
dbr
:Diameter
dbr
:Polynomial
dbr
:NP-hardness
dbr
:Upper_and_lower_bounds
dbr
:Degree_diameter_problem
dbr
:APX
dbp:
wikiPageUsesTemplate
dbt
:Graph-stub
dbt
:No_footnotes
dbt
:Refend
dbt
:Refbegin
dct:
subject
dbc
:Computational_problems_in_graph_theory
gold:
hypernym
dbr
:Problem
rdfs:
label
MaxDDBS
(en)
owl:
sameAs
yago-res
:MaxDDBS
freebase
:MaxDDBS
wikidata
:MaxDDBS
dbpedia-global
:MaxDDBS
prov:
wasDerivedFrom
wikipedia-en
:MaxDDBS?oldid=1258128309&ns=0
foaf:
isPrimaryTopicOf
wikipedia-en
:MaxDDBS
is
dbo:
wikiPageWikiLink
of
dbr
:Degree_diameter_problem
is
foaf:
primaryTopic
of
wikipedia-en
:MaxDDBS
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International