Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5067368> ?p ?o }
Showing triples 1 to 72 of
72
with 100 triples per page.
- Q5067368 subject Q6465283.
- Q5067368 subject Q8498914.
- Q5067368 abstract "In graph theory, the treewidth of an undirected graph is a number associated with the graph. Treewidth may be defined in several equivalent ways: from the size of the largest vertex set in a tree decomposition of the graph, from the size of the largest clique in a chordal completion of the graph, from the maximum order of a haven describing a strategy for a pursuit-evasion game on the graph, or from the maximum order of a bramble, a collection of connected subgraphs that all touch each other.Treewidth is commonly used as a parameter in the parameterized complexity analysis of graph algorithms. The graphs with treewidth at most k are also called partial k-trees; many other well-studied graph families also have bounded treewidth.The concept of treewidth was originally introduced by Umberto Bertelé and Francesco Brioschi (1972) under the name of dimension. It was later rediscovered by Rudolf Halin (1976), based on properties that it shares with a different graph parameter, the Hadwiger number. Later it was again rediscovered by Neil Robertson and Paul Seymour (1984) and has since been studied by many other authors.".
- Q5067368 thumbnail Tree_decomposition.svg?width=300.
- Q5067368 wikiPageExternalLink AAAI97-029.pdf.
- Q5067368 wikiPageExternalLink graph.theory.
- Q5067368 wikiPageExternalLink paper.pdf.
- Q5067368 wikiPageWikiLink Q1067731.
- Q5067368 wikiPageWikiLink Q1187693.
- Q5067368 wikiPageWikiLink Q1192100.
- Q5067368 wikiPageWikiLink Q131476.
- Q5067368 wikiPageWikiLink Q13222616.
- Q5067368 wikiPageWikiLink Q1322892.
- Q5067368 wikiPageWikiLink Q1343660.
- Q5067368 wikiPageWikiLink Q1396427.
- Q5067368 wikiPageWikiLink Q1531456.
- Q5067368 wikiPageWikiLink Q1548746.
- Q5067368 wikiPageWikiLink Q1570441.
- Q5067368 wikiPageWikiLink Q1699014.
- Q5067368 wikiPageWikiLink Q17098085.
- Q5067368 wikiPageWikiLink Q176916.
- Q5067368 wikiPageWikiLink Q188884.
- Q5067368 wikiPageWikiLink Q194404.
- Q5067368 wikiPageWikiLink Q215206.
- Q5067368 wikiPageWikiLink Q223335.
- Q5067368 wikiPageWikiLink Q2362924.
- Q5067368 wikiPageWikiLink Q2742711.
- Q5067368 wikiPageWikiLink Q2913731.
- Q5067368 wikiPageWikiLink Q2985068.
- Q5067368 wikiPageWikiLink Q3033506.
- Q5067368 wikiPageWikiLink Q3115543.
- Q5067368 wikiPageWikiLink Q3115604.
- Q5067368 wikiPageWikiLink Q3186905.
- Q5067368 wikiPageWikiLink Q380679.
- Q5067368 wikiPageWikiLink Q381060.
- Q5067368 wikiPageWikiLink Q4545823.
- Q5067368 wikiPageWikiLink Q4555371.
- Q5067368 wikiPageWikiLink Q45715.
- Q5067368 wikiPageWikiLink Q462095.
- Q5067368 wikiPageWikiLink Q47506.
- Q5067368 wikiPageWikiLink Q4779442.
- Q5067368 wikiPageWikiLink Q4780395.
- Q5067368 wikiPageWikiLink Q4904170.
- Q5067368 wikiPageWikiLink Q4956109.
- Q5067368 wikiPageWikiLink Q504843.
- Q5067368 wikiPageWikiLink Q5178114.
- Q5067368 wikiPageWikiLink Q5251771.
- Q5067368 wikiPageWikiLink Q5467387.
- Q5067368 wikiPageWikiLink Q547823.
- Q5067368 wikiPageWikiLink Q5597073.
- Q5067368 wikiPageWikiLink Q5638117.
- Q5067368 wikiPageWikiLink Q5642351.
- Q5067368 wikiPageWikiLink Q5683658.
- Q5067368 wikiPageWikiLink Q622506.
- Q5067368 wikiPageWikiLink Q6465283.
- Q5067368 wikiPageWikiLink Q6497118.
- Q5067368 wikiPageWikiLink Q7140374.
- Q5067368 wikiPageWikiLink Q7144893.
- Q5067368 wikiPageWikiLink Q7254793.
- Q5067368 wikiPageWikiLink Q7261573.
- Q5067368 wikiPageWikiLink Q7454787.
- Q5067368 wikiPageWikiLink Q761631.
- Q5067368 wikiPageWikiLink Q7837500.
- Q5067368 wikiPageWikiLink Q7922780.
- Q5067368 wikiPageWikiLink Q835942.
- Q5067368 wikiPageWikiLink Q8366.
- Q5067368 wikiPageWikiLink Q8498914.
- Q5067368 wikiPageWikiLink Q905837.
- Q5067368 wikiPageWikiLink Q917421.
- Q5067368 comment "In graph theory, the treewidth of an undirected graph is a number associated with the graph.".
- Q5067368 label "Treewidth".
- Q5067368 depiction Tree_decomposition.svg.