Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5683658> ?p ?o }
Showing triples 1 to 35 of
35
with 100 triples per page.
- Q5683658 subject Q6465276.
- Q5683658 subject Q7036109.
- Q5683658 subject Q8498914.
- Q5683658 abstract "In graph theory, a haven is a certain type of function on sets of vertices in an undirected graph. If a haven exists, it can be used by an evader to win a pursuit-evasion game on the graph, by consulting the function at each step of the game to determine a safe set of vertices to move into. Havens were first introduced by Seymour & Thomas (1993) as a tool for characterizing the treewidth of graphs. Their other applications include proving the existence of small separators on minor-closed families of graphs, and characterizing the ends and clique minors of infinite graphs.".
- Q5683658 thumbnail 3x3_grid_graph_haven.svg?width=300.
- Q5683658 wikiPageWikiLink Q1211071.
- Q5683658 wikiPageWikiLink Q1304193.
- Q5683658 wikiPageWikiLink Q130998.
- Q5683658 wikiPageWikiLink Q131476.
- Q5683658 wikiPageWikiLink Q141488.
- Q5683658 wikiPageWikiLink Q163875.
- Q5683658 wikiPageWikiLink Q166507.
- Q5683658 wikiPageWikiLink Q194404.
- Q5683658 wikiPageWikiLink Q2997928.
- Q5683658 wikiPageWikiLink Q3527155.
- Q5683658 wikiPageWikiLink Q45715.
- Q5683658 wikiPageWikiLink Q4956109.
- Q5683658 wikiPageWikiLink Q5067368.
- Q5683658 wikiPageWikiLink Q5375783.
- Q5683658 wikiPageWikiLink Q5467387.
- Q5683658 wikiPageWikiLink Q5638117.
- Q5683658 wikiPageWikiLink Q6465276.
- Q5683658 wikiPageWikiLink Q6497118.
- Q5683658 wikiPageWikiLink Q7036109.
- Q5683658 wikiPageWikiLink Q7200963.
- Q5683658 wikiPageWikiLink Q7261573.
- Q5683658 wikiPageWikiLink Q761631.
- Q5683658 wikiPageWikiLink Q7922780.
- Q5683658 wikiPageWikiLink Q8498914.
- Q5683658 wikiPageWikiLink Q905837.
- Q5683658 wikiPageWikiLink Q908627.
- Q5683658 wikiPageWikiLink Q9299950.
- Q5683658 comment "In graph theory, a haven is a certain type of function on sets of vertices in an undirected graph. If a haven exists, it can be used by an evader to win a pursuit-evasion game on the graph, by consulting the function at each step of the game to determine a safe set of vertices to move into. Havens were first introduced by Seymour & Thomas (1993) as a tool for characterizing the treewidth of graphs.".
- Q5683658 label "Haven (graph theory)".
- Q5683658 depiction 3x3_grid_graph_haven.svg.