On Temporal Graph Exploration
暂无分享,去创建一个
[1] K. Berman. Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.
[2] Nicola Santoro,et al. Time-varying graphs and dynamic networks , 2010, Int. J. Parallel Emergent Distributed Syst..
[3] Bernard Mans,et al. Exploration of Periodically Varying Graphs , 2009, ISAAC.
[4] Othon Michail,et al. An Introduction to Temporal Graphs: An Algorithmic Perspective* , 2015, Internet Math..
[5] Pierre A. Humblet,et al. A Distributed Algorithm for Minimum-Weight Spanning Trees , 1979, TOPL.
[6] Paul G. Spirakis,et al. Traveling salesman problems in temporal graphs , 2014, Theor. Comput. Sci..
[7] H. Kesten. The critical probability of bond percolation on the square lattice equals 1/2 , 1980 .
[8] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..
[9] Ton Kloks. Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Bernard Mans,et al. Measuring Temporal Lags in Delay-Tolerant Networks , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.
[12] Anna R. Karlin,et al. On the fault tolerance of the butterfly , 1994, STOC '94.
[13] Afonso Ferreira,et al. Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..
[14] Kenneth A. Berman. Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.
[15] János Komlós,et al. Largest random component of ak-cube , 1982, Comb..
[16] Rahul Shah,et al. Restricted Shortest Path in Temporal Graphs , 2015, DEXA.
[17] Dariusz R. Kowalski,et al. Gossiping to reach consensus , 2002, SPAA '02.
[18] Jean-Claude Bermond,et al. Fast Gossiping by Short Messages , 1995, ICALP.
[19] Amit Kumar,et al. Connectivity and inference problems for temporal networks , 2000, STOC '00.
[20] Bengt J. Nilsson,et al. Online and Offline Algorithms for the Time-Dependent TSP with Time Zones , 2004, Algorithmica.
[21] Nancy A. Lynch,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[22] Jie Wu,et al. Scalable Routing in Cyclic Mobile Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.
[23] Christian Scheideler. Models and Techniques for Communication in Dynamic Networks , 2002, STACS.