| http://www.w3.org/ns/prov#value | - The closure network represents that is connected completely in a full-mesh fashion with the aid of a path having a minimum cost between the source node S, the group of the destination node M, and the group of the virtual destination nodes VD. Specifically, the above step is a process of simplifying the network to reduce the computational complexity and to compute a least cost route connecting the
|
