> By Clémence Magnien, Matthieu Latapy and Michel Habib Computing the diameter (i.e. the maximal distance between two nodes) of a huge graph is in many cases too time-consuming to be performed. In Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs we propose several methods to obtain upper and lower bounds […]

### Next Event(s)

**Gendarmes, Voleurs et Topologie algébrique**David Ellison*2017, June 15, Room 24-25/405*- affinity index algorithm analysis antipaedo attack bipartite blog network blogs capitalisme social Cascade centrality clustering communities community detection community structure complex network complex networks complex systems compression connected graphs data mining debian degree distribution degree peeling diameter diffusion diffusion phenomena distributed measurements DynamicNetworks dynamics edge-Markovian evolving graph eDonkey ego-centered ego-centered communities email epidemiology event detection evolving graphs evolving networks exploration failure fixed points formal concepts gossip graph graph algorithm graph decompositions Graphs hierarchical clustering honeypot influence influence ranking interaction networks internal links internet Internet topology intrinsic time IP-level ip exchanges lattice leaders link prediction long term communities markovian model measurement mesure d’influence metrics Metrology mobile networks Modelling modularity multi-ego-centered communities multi-scale multipartite graph network dynamics node proximity node similarity opinion dynamics outliers p2p P2P dynamics P2P networks parametric paris paris-traceroute path-vector routing pedophile activity phone power-law radar random graph random walks reachability robustness routing routing tables scale-free security simulation simulations sir social networks spreading spreading cascades stability statistical analysis stochastic process three-state cellular automata time-varying Topology traceroute triangles twitter UDP user profiles viral marketing visualization web wifi