| http://www.w3.org/ns/prov#value | - If G is an undirected graph, and X is a set of vertices, then an X-flap is a nonempty connected component of the subgraph of G formed by deleting X. A haven of order k in G is a function ?? that assigns an X-flap ??(X) to every set X of fewer than k vertices.
|
