Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Degree-constrained_spanning_tree> ?p ?o }
Showing triples 1 to 36 of
36
with 100 triples per page.
- Degree-constrained_spanning_tree abstract "In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem is to determine whether a particular graph has such a spanning tree for a particular k.".
- Degree-constrained_spanning_tree wikiPageID "3037035".
- Degree-constrained_spanning_tree wikiPageLength "2641".
- Degree-constrained_spanning_tree wikiPageOutDegree "12".
- Degree-constrained_spanning_tree wikiPageRevisionID "702633638".
- Degree-constrained_spanning_tree wikiPageWikiLink Category:NP-complete_problems.
- Degree-constrained_spanning_tree wikiPageWikiLink Category:Spanning_tree.
- Degree-constrained_spanning_tree wikiPageWikiLink Computers_and_Intractability.
- Degree-constrained_spanning_tree wikiPageWikiLink Constant_(mathematics).
- Degree-constrained_spanning_tree wikiPageWikiLink Degree_(graph_theory).
- Degree-constrained_spanning_tree wikiPageWikiLink Graph_(discrete_mathematics).
- Degree-constrained_spanning_tree wikiPageWikiLink Graph_theory.
- Degree-constrained_spanning_tree wikiPageWikiLink Hamiltonian_path_problem.
- Degree-constrained_spanning_tree wikiPageWikiLink Integer.
- Degree-constrained_spanning_tree wikiPageWikiLink NP-completeness.
- Degree-constrained_spanning_tree wikiPageWikiLink Node_(computer_science).
- Degree-constrained_spanning_tree wikiPageWikiLink Spanning_tree.
- Degree-constrained_spanning_tree wikiPageWikiLinkText "Degree-Constrained Spanning Tree".
- Degree-constrained_spanning_tree wikiPageWikiLinkText "Degree-constrained spanning tree".
- Degree-constrained_spanning_tree wikiPageWikiLinkText "degree constrained minimum spanning tree".
- Degree-constrained_spanning_tree wikiPageUsesTemplate Template:Citation.
- Degree-constrained_spanning_tree wikiPageUsesTemplate Template:Harv.
- Degree-constrained_spanning_tree wikiPageUsesTemplate Template:Harvtxt.
- Degree-constrained_spanning_tree wikiPageUsesTemplate Template:Reflist.
- Degree-constrained_spanning_tree subject Category:NP-complete_problems.
- Degree-constrained_spanning_tree subject Category:Spanning_tree.
- Degree-constrained_spanning_tree hypernym Tree.
- Degree-constrained_spanning_tree type Plant.
- Degree-constrained_spanning_tree type Algorithm.
- Degree-constrained_spanning_tree comment "In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem is to determine whether a particular graph has such a spanning tree for a particular k.".
- Degree-constrained_spanning_tree label "Degree-constrained spanning tree".
- Degree-constrained_spanning_tree sameAs Q5251832.
- Degree-constrained_spanning_tree sameAs m.08m96h.
- Degree-constrained_spanning_tree sameAs Q5251832.
- Degree-constrained_spanning_tree wasDerivedFrom Degree-constrained_spanning_tree?oldid=702633638.
- Degree-constrained_spanning_tree isPrimaryTopicOf Degree-constrained_spanning_tree.