Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Bramble_(graph_theory)> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples per page.
- Bramble_(graph_theory) abstract "In graph theory, a bramble for an undirected graph G is a family of connected subgraphs of G that all touch each other: for every pair of disjoint subgraphs, there must exist an edge in G that has one endpoint in each subgraph. The order of a bramble is the smallest size of a hitting set, a set of vertices of G that has a nonempty intersection with each of the subgraphs. Brambles may be used to characterize the treewidth of G.".
- Bramble_(graph_theory) thumbnail 3x3_grid_graph_haven.svg?width=300.
- Bramble_(graph_theory) wikiPageID "36601188".
- Bramble_(graph_theory) wikiPageLength "5566".
- Bramble_(graph_theory) wikiPageOutDegree "15".
- Bramble_(graph_theory) wikiPageRevisionID "702552537".
- Bramble_(graph_theory) wikiPageWikiLink Approximation_algorithm.
- Bramble_(graph_theory) wikiPageWikiLink Category:Graph_minor_theory.
- Bramble_(graph_theory) wikiPageWikiLink Category:Graph_theory_objects.
- Bramble_(graph_theory) wikiPageWikiLink Connectivity_(graph_theory).
- Bramble_(graph_theory) wikiPageWikiLink Degree_(graph_theory).
- Bramble_(graph_theory) wikiPageWikiLink Expander_graph.
- Bramble_(graph_theory) wikiPageWikiLink Glossary_of_graph_theory.
- Bramble_(graph_theory) wikiPageWikiLink Graph_(discrete_mathematics).
- Bramble_(graph_theory) wikiPageWikiLink Haven_(graph_theory).
- Bramble_(graph_theory) wikiPageWikiLink Randomized_algorithm.
- Bramble_(graph_theory) wikiPageWikiLink Set_cover_problem.
- Bramble_(graph_theory) wikiPageWikiLink Time_complexity.
- Bramble_(graph_theory) wikiPageWikiLink Treewidth.
- Bramble_(graph_theory) wikiPageWikiLink File:3x3_grid_graph_haven.svg.
- Bramble_(graph_theory) wikiPageWikiLinkText "Bramble (graph theory)".
- Bramble_(graph_theory) wikiPageWikiLinkText "Brambles".
- Bramble_(graph_theory) wikiPageWikiLinkText "bramble".
- Bramble_(graph_theory) wikiPageWikiLinkText "brambles".
- Bramble_(graph_theory) wikiPageUsesTemplate Template:Harvtxt.
- Bramble_(graph_theory) wikiPageUsesTemplate Template:Reflist.
- Bramble_(graph_theory) subject Category:Graph_minor_theory.
- Bramble_(graph_theory) subject Category:Graph_theory_objects.
- Bramble_(graph_theory) hypernym Family.
- Bramble_(graph_theory) type Object.
- Bramble_(graph_theory) comment "In graph theory, a bramble for an undirected graph G is a family of connected subgraphs of G that all touch each other: for every pair of disjoint subgraphs, there must exist an edge in G that has one endpoint in each subgraph. The order of a bramble is the smallest size of a hitting set, a set of vertices of G that has a nonempty intersection with each of the subgraphs. Brambles may be used to characterize the treewidth of G.".
- Bramble_(graph_theory) label "Bramble (graph theory)".
- Bramble_(graph_theory) sameAs Q4956109.
- Bramble_(graph_theory) sameAs m.0knwhq_.
- Bramble_(graph_theory) sameAs Ежевика_(теория_графов).
- Bramble_(graph_theory) sameAs Q4956109.
- Bramble_(graph_theory) wasDerivedFrom Bramble_(graph_theory)?oldid=702552537.
- Bramble_(graph_theory) depiction 3x3_grid_graph_haven.svg.
- Bramble_(graph_theory) isPrimaryTopicOf Bramble_(graph_theory).