- document
-
Wang, H. (author), Douw, L. (author), Hernández, J.M. (author), Reijneveld, J.C. (author), Stam, C.J. (author), Van Mieghem, P. (author)Brain functioning such as cognitive performance depends on the functional interactions between brain areas, namely, the functional brain networks. The functional brain networks of a group of patients with brain tumors are measured before and after tumor resection. In this work, we perform a weighted network analysis to understand the effect of...journal article 2010
- document
-
Van Mieghem, P. (author), Wang, H. (author), Ge, X. (author), Tang, S. (author), Kuipers, F.A. (author)Newman’s measure for (dis)assortativity, the linear degree correlation coefficient ?D, is reformulated in terms of the total number Nk of walks in the graph with k hops. This reformulation allows us to derive a new formula from which a degree-preserving rewiring algorithm is deduced, that, in each rewiring step, either increases or decreases ?D...journal article 2010
- document
-
Wang, H. (author), Kooij, R.E. (author), Van Mieghem, P. (author)We propose a class of graphs G?D(n1, n2, ..., nD+1), containing of a chain of D+1 cliques Kn1 , Kn2 , ..., KnD+1, where neighboring cliques are fully-interconnected. The class of graphs has diameter D and size N = ? 1?i?D+1ni. We prove that this class of graphs can achieve the maximal number of links, the minimum average hopcount, and more...journal article 2010
- document
-
Liu, D. (author), Wang, H. (author), Van Mieghem, P. (author)In recent years, many network perturbation techniques, such as topological perturbations and service perturbations, were employed to study and improve the robustness of complex networks. However, there is no general way to evaluate the network robustness. In this paper, we propose a global measure for a network, the reconstructability...journal article 2010
- document
-
Van Mieghem, P (author)The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generating function and the asymptotic law are derived. As a remarkable coincidence, this asymptotic law is precisely the same as the distribution of the cost of one “job” in...journal article 2010
- document
- Van Mieghem, P.F.A. (author), Wang, H. (author), Ge, X (author), Tang, S. (author), Kuipers, F.A. (author) journal article 2010
- document
- Van Mieghem, P. (author), Wang, H. (author) journal article 2009
- document
- Van Mieghem, P. (author), Omic, J. (author), Kooij, R. (author) journal article 2009
- document
- Lu, Y (author), Fallica, B (author), Kuipers, F.A. (author), Kooij, Robert (author), Van Mieghem, P.F.A. (author) journal article 2009
- document
- Wang, H. (author), Martin Hernandez, J. (author), Van Mieghem, P. (author) journal article 2008
- document
-
Masip-Bruin, X (author), Yannuzzi, M (author), Domingo-Pascual, J (author), Fonte, A (author), Curado, M (author), Monteiro, E (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author), Avallone, S (author), Ventre, G (author), Aranda-Gutiérrez, P (author), Hollick, M (author), Steinmetz, R (author), Iannone, L (author), Salamatian, K (author)Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities that cannot be provided by the current QoS-unaware routing protocols. The provisioning of QoS based network services is in general terms an extremely complex problem,...journal article 2006
- document
- Van Mieghem, P. (author), Van Langen, S. (author) journal article 2005
- document
- Van Mieghem, P. (author), Magdalena, S.M. (author) journal article 2005
- document
- Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) journal article 2005
- document
- Kuipers, F.A. (author), Van Mieghem, P. (author) journal article 2005
- document
-
Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)Finding a path in a network based on multiple constraints (the MCP problem) is often considered an integral part of quality of service (QoS) routing. QoS routing with constraints on multiple additive measures has been proven to be NP-complete. This proof has dramatically influenced the research community, resulting into the common belief that...journal article 2005
- document
- Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) journal article 2005
- document
- Kuipers, F. (author), Korkmaz, T. (author), Krunz, M. (author), Van Mieghem, P. (author) journal article 2004
- document
- Kuipers, F.A. (author), Korkmaz, T. (author), Krunz, M. (author), Van Mieghem, P.F.A. (author) journal article 2004
- document
- Van Mieghem, P.F.A. (author), Kuipers, F.A. (author) journal article 2003