This HTML5 document contains 32 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n7https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Minimum_degree_spanning_tree
rdfs:label
Minimum degree spanning tree
rdfs:comment
In graph theory, a minimum degree spanning tree is a subset of the edges of a connected graph that connects all the vertices together, without any cycles, and its maximum degree of its vertices as small as possible. That is, it is a spanning tree whose maximum degree is minimal. The decision problem is: Given a graph G and an integer k, does G have a spanning tree such that no vertex has degree greater than k? This is also known as the degree-constrained spanning tree problem.
dcterms:subject
dbc:Spanning_tree
dbo:wikiPageID
2624629
dbo:wikiPageRevisionID
1080958631
dbo:wikiPageWikiLink
dbr:Quasi-polynomial_time dbr:Directed_acyclic_graph dbr:Vertex_(graph_theory) dbc:Spanning_tree dbr:Polynomial_time dbr:Cycle_(graph_theory) dbr:Connectivity_(graph_theory) dbr:Degree-constrained_spanning_tree dbr:Series-parallel_graph dbr:Hamiltonian_path_problem dbr:Linear_time dbr:NP-hard dbr:Graph_theory dbr:Spanning_tree
owl:sameAs
wikidata:Q6865444 n7:4rbN9 freebase:m.07sk9j
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
In graph theory, a minimum degree spanning tree is a subset of the edges of a connected graph that connects all the vertices together, without any cycles, and its maximum degree of its vertices as small as possible. That is, it is a spanning tree whose maximum degree is minimal. The decision problem is: Given a graph G and an integer k, does G have a spanning tree such that no vertex has degree greater than k? This is also known as the degree-constrained spanning tree problem.
prov:wasDerivedFrom
wikipedia-en:Minimum_degree_spanning_tree?oldid=1080958631&ns=0
dbo:wikiPageLength
2519
foaf:isPrimaryTopicOf
wikipedia-en:Minimum_degree_spanning_tree
Subject Item
dbr:Spanning_tree
dbo:wikiPageWikiLink
dbr:Minimum_degree_spanning_tree
Subject Item
dbr:Spanning_tree_(disambiguation)
dbo:wikiPageWikiLink
dbr:Minimum_degree_spanning_tree
dbo:wikiPageDisambiguates
dbr:Minimum_degree_spanning_tree
Subject Item
dbr:List_of_NP-complete_problems
dbo:wikiPageWikiLink
dbr:Minimum_degree_spanning_tree
Subject Item
wikipedia-en:Minimum_degree_spanning_tree
foaf:primaryTopic
dbr:Minimum_degree_spanning_tree