Haven (graph theory)
id:
haven-graph-theory-246-14621553
title:
Haven (graph theory)
text:
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 familie
brand slug:
wiki
category slug:
encyclopedia
description:
Method of graph decomposition
original url:
https://en.wikipedia.org/wiki/Haven_(graph_theory)
date created:
date modified:
2022-07-10T00:00:19Z
main entity:
{"identifier":"Q5683658","url":"https://www.wikidata.org/entity/Q5683658"}
image:
fields total:
13
integrity:
14