Zobrazeno 1 - 10
of 11
pro vyhledávání: '"real-life networks"'
Publikováno v:
Risks, Vol 3, Iss 1, Pp 1-23 (2015)
The study of random graphs has become very popular for real-life network modeling, such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice Zd, d ≥ 1, is a particular attractive
Externí odkaz:
https://doaj.org/article/8e3094c1a0c84e41a3099ca645475ac0
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Transactions on Magnetics
IEEE Transactions on Magnetics, Institute of Electrical and Electronics Engineers, 2018, 54 (3), pp.8700304. ⟨10.1109/TMAG.2017.2765463⟩
IEEE Transactions on Magnetics, 2018, 54 (3), pp.8700304. ⟨10.1109/TMAG.2017.2765463⟩
IEEE Transactions on Magnetics, Institute of Electrical and Electronics Engineers, 2018, 54 (3), pp.8700304. ⟨10.1109/TMAG.2017.2765463⟩
IEEE Transactions on Magnetics, 2018, 54 (3), pp.8700304. ⟨10.1109/TMAG.2017.2765463⟩
International audience; Decomposition of the time-reversal (TR) operator (DORT), a recently applied TR method to transmission lines, has proven to be effective in detecting and locating soft faults in complex wire networks. In this paper, we will pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20527f709a70ffe30b4ebee7f820d6eb
https://hal-centralesupelec.archives-ouvertes.fr/hal-01639241/file/08107704.pdf
https://hal-centralesupelec.archives-ouvertes.fr/hal-01639241/file/08107704.pdf
Autor:
Zhou, Yi
Cette thèse présente des algorithmes de résolution de quatre problèmes de clique : clique de poids maximum (MVWCP), s-plex maximum (MsPlex), clique maximum équilibrée dans un graphe biparti (MBBP) et clique partition (CPP). Les trois premiers p
Externí odkaz:
http://www.theses.fr/2017ANGE0013/document
Autor:
Zhou, Yi
Publikováno v:
Optimization and Control [math.OC]. Université d'Angers, 2017. English. ⟨NNT : 2017ANGE0013⟩
This thesis considers four clique problems: the maximum vertex weight clique problem (MVWCP), the maximum s-plex problem (MsPlex), the maximum balanced biclique problem (MBBP) and the clique partitioning problem (CPP). The first three are generalizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3988fe2b8151faafda7bd4d1fa29c12b
https://tel.archives-ouvertes.fr/tel-01707043
https://tel.archives-ouvertes.fr/tel-01707043
Recently in few papers, a balanced disk separator of graphs were recursively used to construct one or a small set of spanning trees that sharply approximate distances in a given graph. The best up to date approximation algorithms were obtained for mu
Externí odkaz:
http://rave.ohiolink.edu/etdc/view?acc_num=kent1429541936
Publikováno v:
Risks
Volume 3
Issue 1
Pages 1-23
Risks, Vol 3, Iss 1, Pp 1-23 (2015)
Risks, 3 (1)
Volume 3
Issue 1
Pages 1-23
Risks, Vol 3, Iss 1, Pp 1-23 (2015)
Risks, 3 (1)
The study of random graphs has become very popular for real-life network modeling, such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice Zd, d ≥ 1, is a particular attractive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b338ebb37f257d1a9b483b86869c62a2
Publikováno v:
Scientific Reports
The vulnerability to real-life networks against small initial attacks has been one of outstanding challenges in the study of interrelated networks. We study cascading failures in two interrelated networks S and B composed from dependency chains and c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b866541ed571f887d412338c178f8e9
http://europepmc.org/articles/PMC4067616
http://europepmc.org/articles/PMC4067616
In this paper we study the spectral radius of a number of real-life networks. This study is motivated by the fact that the smaller the spectral radius, the higher the robustness of a network against the spread of viruses. First we study how wellknown
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::786be11d45e94fd52e73e21511d344d2
http://resolver.tudelft.nl/uuid:6e96bbe0-f023-4403-9eb6-9334764f3d7e
http://resolver.tudelft.nl/uuid:6e96bbe0-f023-4403-9eb6-9334764f3d7e
Publikováno v:
Proceedings of the 13th Annual Symposium of the IEEE/CVT Benelux, Liege, November 23, 2006
2006 Symposium on Communications and Vehicular Technology, IEEE SCVT 2006; 13th Annual Symposium on Communications and Vehicular Technology in the Benelux, 23 November 2006 through 23 November 2006, Liege, Conference code: 72419, 35-38
2006 Symposium on Communications and Vehicular Technology, IEEE SCVT 2006; 13th Annual Symposium on Communications and Vehicular Technology in the Benelux, 23 November 2006 through 23 November 2006, Liege, Conference code: 72419, 35-38
In this paper we study the spectral radius of a number of real-life networks. This study is motivated by the fact that the smaller the spectral radius, the higher the robustness of a network against the spread of viruses. First we study how wellknown
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6d1026c42ba95e607d99f90b97cc86a
http://resolver.tudelft.nl/uuid:520fe48c-55ff-464b-b66f-891a2c68d102
http://resolver.tudelft.nl/uuid:520fe48c-55ff-464b-b66f-891a2c68d102