| http://www.w3.org/ns/prov#value | - It is shown that the general problem is #P-complete, and two special cases are considered: case 1 assumes the network is a directed acyclic graph oriented toward the destination, and case 2 assumes that the link states are independent from slot to slot.
|
