Time-varying graphs and dynamic networks
暂无分享,去创建一个
Nicola Santoro | Paola Flocchini | Walter Quattrociocchi | Arnaud Casteigts | Walter Quattrociocchi | P. Flocchini | N. Santoro | Arnaud Casteigts | W. Quattrociocchi | A. Casteigts
[1] Baruch Awerbuch,et al. Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. , 1984, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.
[2] K. Berman. Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.
[3] Kenneth A. Berman,et al. Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.
[4] Frank Harary,et al. Dynamic graph models , 1997 .
[5] Albert-László Barabási,et al. Internet: Diameter of the World-Wide Web , 1999, Nature.
[6] Yves Métivier,et al. Graph relabelling systems and distributed algorithms , 1999 .
[7] M. Newman,et al. Epidemics and percolation in small-world networks. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[8] Henning Schulzrinne,et al. Seven degrees of separation in mobile ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).
[9] Amit Kumar,et al. Connectivity and inference problems for temporal networks , 2000, STOC '00.
[10] Jon M. Kleinberg,et al. Protocols and impossibility results for gossip-based communication mechanisms , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[11] Anders Lindgren,et al. Probabilistic routing in intermittently connected networks , 2003, MOCO.
[12] Afonso Ferreira,et al. Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..
[13] Afonso Ferreira,et al. Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks , 2003, ADHOC-NOW.
[14] Martin Vetterli,et al. Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusion , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[15] Afonso Ferreira,et al. Building a reference combinatorial model for MANETs , 2004, IEEE Network.
[16] Michael J. Fischer,et al. Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.
[17] Hirotsugu Kakugawa,et al. A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks , 2004, OPODIS.
[18] Cauligi S. Raghavendra,et al. Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.
[19] P. Holme. Network reachability of real-world contact sequences. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[20] Roger Wattenhofer,et al. Information dissemination in highly dynamic graphs , 2005, DIALM-POMC '05.
[21] Alex Pentland,et al. Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.
[22] Jon M. Kleinberg,et al. Group formation in large social networks: membership, growth, and evolution , 2006, KDD '06.
[23] Zhensheng Zhang,et al. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.
[24] I. Cardei,et al. ROUTING IN WIRELESS NETWORKS WITH INTERMITTENT CONNECTIVITY , 2006 .
[25] Brian Gallagher,et al. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[26] David Eisenstat,et al. The computational power of population protocols , 2006, Distributed Computing.
[27] Laurent Massoulié,et al. The diameter of opportunistic mobile networks , 2007, CoNEXT '07.
[28] Srinivasan Keshav,et al. Fair and efficient scheduling in data ferrying networks , 2007, CoNEXT '07.
[29] Rajesh Krishnan,et al. Towards a formalism for routing in challenged networks , 2007, CHANTS '07.
[30] Paul A. S. Ward,et al. Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.
[31] Christos Faloutsos,et al. Graph evolution: Densification and shrinking diameters , 2006, TKDD.
[32] Christophe Diot,et al. Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.
[33] Ahmed Helmy,et al. Modeling Time-Variant User Mobility in Wireless Mobile Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[34] Arun Venkataramani,et al. Web search from a bus , 2007, CHANTS '07.
[35] Donald F. Towsley,et al. Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing , 2007, MobiCom '07.
[36] Andrea E. F. Clementi,et al. Flooding time in edge-Markovian dynamic graphs , 2008, PODC '08.
[37] Yves Mahéo,et al. Middleware support for delay-tolerant service provision in disconnected mobile ad hoc networks , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.
[38] Céline Robardet,et al. Description and simulation of dynamic mobility networks , 2008, Comput. Networks.
[39] Jean-Loup Guillaume,et al. Fast unfolding of communities in large networks , 2008, 0803.0476.
[40] Alessandro Vespignani,et al. K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases , 2005, Networks Heterog. Media.
[41] Chen Avin,et al. How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) , 2008, ICALP.
[42] Hari Balakrishnan,et al. Cabernet: vehicular content delivery using WiFi , 2008, MobiCom '08.
[43] C. Avin,et al. How to Explore a Fast-Changing World , 2008 .
[44] Jon M. Kleinberg,et al. The structure of information pathways in a social communication network , 2008, KDD.
[45] Antoine Dutot,et al. GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs , 2008, ArXiv.
[46] Anis Laouiti,et al. Vehicle Ad Hoc networks: applications and related technical issues , 2008, IEEE Communications Surveys & Tutorials.
[47] Serge Chaumette,et al. Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks , 2009, SIROCCO.
[48] Bernard Mans,et al. Exploration of Periodically Varying Graphs , 2009, ISAAC.
[49] Mathieu Bastian,et al. Gephi: An Open Source Software for Exploring and Manipulating Networks , 2009, ICWSM.
[50] Bernard Mans,et al. Information Propagation Speed in Mobile and Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.
[51] Shin-Ywan Wang,et al. The Deep Impact Network Experiment Operations Center Monitor and Control System , 2009, 2009 Third IEEE International Conference on Space Mission Challenges for Information Technology.
[52] Jie Wu,et al. Scalable Routing in Cyclic Mobile Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.
[53] Jörg Ott,et al. DTN over aerial carriers , 2009, CHANTS '09.
[54] V Latora,et al. Small-world behavior in time-varying graphs. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.
[55] Nancy A. Lynch,et al. Distributed computation in dynamic networks , 2010, STOC '10.
[56] Bernard Mans,et al. Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility , 2010, IFIP TCS.
[57] Peter C. Mason,et al. Mapping an Unfriendly Subway System , 2010, FUN.
[58] Cecilia Mascolo,et al. Characterising temporal distance and reachability in mobile and online social networks , 2010, CCRV.
[59] Andrea Passarella,et al. HCMM: Modelling spatial and temporal properties of human mobility driven by users' social relationships , 2010, Comput. Commun..
[60] Christos Faloutsos,et al. Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..
[61] Cecilia Mascolo,et al. Analysing information flows and key mediators through temporal centrality metrics , 2010, SNS '10.
[62] Peter C. Mason,et al. Searching for Black Holes in Subways , 2011, Theory of Computing Systems.
[63] David Ilcinkas,et al. On the Power of Waiting When Exploring Public Transportation Systems , 2011, OPODIS.
[64] Serge Chaumette,et al. On the Assumptions about Network Dynamics in Distributed Computing , 2011, ArXiv.
[65] Pierre Sens,et al. What model and what conditions to implement unreliable failure detectors in dynamic networks? , 2011, TADDS '11.
[66] Andrea E. F. Clementi,et al. Information Spreading in Dynamic Networks: An Analytical Approach , 2011, Theoretical Aspects of Distributed Computing in Sensor Networks.
[67] Guillaume Chelius,et al. Egomunities, Exploring Socially Cohesive Person-based Communities , 2011, ArXiv.
[68] Bernard Mans,et al. Measuring Temporal Lags in Delay-Tolerant Networks , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.
[69] Pierre Fraigniaud,et al. Parsimonious flooding in dynamic graphs , 2009, PODC '09.
[70] Mark C. Parsons,et al. Social networks: Evolving graphs with memory dependent edges , 2011 .
[71] Nicola Santoro,et al. Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics , 2011, ArXiv.
[72] Yoram Moses,et al. Coordinated consensus in dynamic networks , 2011, PODC '11.
[73] Pascal Bouvry,et al. Information dissemination in VANETs based upon a tree topology , 2012, Ad Hoc Networks.
[74] Ivan Stojmenovic,et al. Acknowledgment-Based Broadcast Protocol for Reliable and Efficient Data Dissemination in Vehicular Ad Hoc Networks , 2012, IEEE Transactions on Mobile Computing.
[75] Ulrik Brandes,et al. What is network science? , 2013, Network Science.