Haven (graph Theory)
In graph theory, a haven is a way of describing a strategy for an evader to win a certain type of pursuit-evasion game on an undirected graph. Havens were first introduced by Seymour & Thomas (1993); they may be used to characterize the treewidth of graphs, to prove the existence of small separators on minor-closed families of graphs, and to characterize the ends and clique minors of infinite graphs.
Read more about Haven (graph Theory): Definition, Example, Pursuit-evasion, Connections To Treewidth, Separators, and Minors, In Infinite Graphs
Famous quotes containing the word haven:
“Quinquireme of Nineveh from distant Ophir
Rowing home to haven in sunny Palestine,”
—John Masefield (1878–1967)