Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Partial_k-tree> ?p ?o }
Showing triples 1 to 58 of
58
with 100 triples per page.
- Partial_k-tree abstract "In graph theory, a partial k-tree is a type of graph, defined either as a subgraph of a k-tree or as a graph with treewidth at most k. Many NP-hard combinatorial problems on graphs are solvable in polynomial time when restricted to the partial k-trees, for bounded values of k.".
- Partial_k-tree thumbnail Partial_3-tree_forbidden_minors.svg?width=300.
- Partial_k-tree wikiPageID "31104477".
- Partial_k-tree wikiPageLength "4285".
- Partial_k-tree wikiPageOutDegree "30".
- Partial_k-tree wikiPageRevisionID "539310304".
- Partial_k-tree wikiPageWikiLink Apollonian_network.
- Partial_k-tree wikiPageWikiLink Biconnected_component.
- Partial_k-tree wikiPageWikiLink Cactus_graph.
- Partial_k-tree wikiPageWikiLink Category:Graph_families.
- Partial_k-tree wikiPageWikiLink Category:Graph_minor_theory.
- Partial_k-tree wikiPageWikiLink Compiler.
- Partial_k-tree wikiPageWikiLink Complete_graph.
- Partial_k-tree wikiPageWikiLink Control_flow_graph.
- Partial_k-tree wikiPageWikiLink Dynamic_programming.
- Partial_k-tree wikiPageWikiLink Forbidden_graph_characterization.
- Partial_k-tree wikiPageWikiLink Forbidden_minor.
- Partial_k-tree wikiPageWikiLink Graph_minor.
- Partial_k-tree wikiPageWikiLink Graph_theory.
- Partial_k-tree wikiPageWikiLink Halin_graph.
- Partial_k-tree wikiPageWikiLink K-tree.
- Partial_k-tree wikiPageWikiLink NP-completeness.
- Partial_k-tree wikiPageWikiLink NP-hard.
- Partial_k-tree wikiPageWikiLink NP-hardness.
- Partial_k-tree wikiPageWikiLink Octahedron.
- Partial_k-tree wikiPageWikiLink Outerplanar_graph.
- Partial_k-tree wikiPageWikiLink Pentagonal_prism.
- Partial_k-tree wikiPageWikiLink Pseudoforest.
- Partial_k-tree wikiPageWikiLink Register_allocation.
- Partial_k-tree wikiPageWikiLink Robertson–Seymour_theorem.
- Partial_k-tree wikiPageWikiLink Series-parallel_graph.
- Partial_k-tree wikiPageWikiLink Structured_programming.
- Partial_k-tree wikiPageWikiLink Tree_(graph_theory).
- Partial_k-tree wikiPageWikiLink Tree_decomposition.
- Partial_k-tree wikiPageWikiLink Treewidth.
- Partial_k-tree wikiPageWikiLink Wagner_graph.
- Partial_k-tree wikiPageWikiLink File:Partial_3-tree_forbidden_minors.svg.
- Partial_k-tree wikiPageWikiLinkText "partial ''k''-trees".
- Partial_k-tree wikiPageWikiLinkText "partial 2-tree".
- Partial_k-tree wikiPageWikiLinkText "partial 3-trees".
- Partial_k-tree hasPhotoCollection Partial_k-tree.
- Partial_k-tree wikiPageUsesTemplate Template:Citation.
- Partial_k-tree wikiPageUsesTemplate Template:Refbegin.
- Partial_k-tree wikiPageUsesTemplate Template:Refend.
- Partial_k-tree wikiPageUsesTemplate Template:Reflist.
- Partial_k-tree subject Category:Graph_families.
- Partial_k-tree subject Category:Graph_minor_theory.
- Partial_k-tree hypernym Graph.
- Partial_k-tree type Software.
- Partial_k-tree type Graph.
- Partial_k-tree comment "In graph theory, a partial k-tree is a type of graph, defined either as a subgraph of a k-tree or as a graph with treewidth at most k. Many NP-hard combinatorial problems on graphs are solvable in polynomial time when restricted to the partial k-trees, for bounded values of k.".
- Partial_k-tree label "Partial k-tree".
- Partial_k-tree sameAs m.0r4qlbg.
- Partial_k-tree sameAs Q7140374.
- Partial_k-tree sameAs Q7140374.
- Partial_k-tree wasDerivedFrom Partial_k-tree?oldid=539310304.
- Partial_k-tree depiction Partial_3-tree_forbidden_minors.svg.
- Partial_k-tree isPrimaryTopicOf Partial_k-tree.