- document
-
Liu, D. (author), Trajanovski, S. (author), Van Mieghem, P. (author)This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H. If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its...journal article 2014
- document
-
Van de Bovenkamp, R. (author), Kuipers, F. (author), Van Mieghem, P. (author)We propose Gossipico, a gossip algorithm to average, sum or find minima and maxima over node values in a large, distributed, and dynamic network. Unlike previous work, Gossipico provides a continuous estimate of, for example, the number of nodes, even when the network becomes disconnected. Gossipico converges quickly due to the introduction of a...conference paper 2012
- document
- Martin Hernandez, J. (author), Kleiberg, T. (author), Wang, H. (author), Van Mieghem, P. (author) conference paper 2007
- document
- Kuipers, F.A. (author), Orda, A. (author), Raz, D. (author), Van Mieghem, P. (author) conference paper 2006