Y. Minsky, personal communication, April 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Connectivity and Inference Problems for Temporal Networks.. - Kempe, al. (1999) (1 citation) (Correct)
.... information, we can ask: for some value of k, are there k (internally) node disjoint time respecting paths from s to t If this is the case, we can be more confident in the accuracy of the information t has learned, since it came along several independent trajectories through the network [14, 16]. In standard graphs, the existence of node disjoint paths is characterized by Menger s Theorem [13] the maximum number of node disjoint s t paths is equal to the minimum number of nodes needed to separate s from t. But there is no analogue of this theorem for arbitrary temporal networks. As ....
Y. Minsky, personal communication, April 1999.
Connectivity and Inference Problems for Temporal Networks - Kempe, Kleinberg, Kumar (2000) (1 citation) (Correct)
.... information, we can ask: for some value of k, are there k (internally) node disjoint time respecting paths from s to t If this is the case, we can be more confident in the accuracy of the information t has learned, since it came along several independent trajectories through the network [14, 16]. In standard graphs, the existence of node disjoint paths is characterized by Menger s Theorem [13] the maximum number of nodedisjoint s t paths is equal to the minimum number of nodes needed to separate s from t. But there is no analogue of this theorem for arbitrary temporal networks. As ....
Y. Minsky, personal communication, April 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC