Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Miriam Di Ianni"'
Autor:
Miriam Di Ianni
Publikováno v:
AppliedMath, Vol 3, Iss 1, Pp 10-36 (2022)
Graph dynamics for a node-labeled graph is a set of updating rules describing how the labels of each node in the graph change in time as a function of the global set of labels. The underpopulation rule is graph dynamics derived by simplifying the set
Externí odkaz:
https://doaj.org/article/295a9c36fdf74316867cf538f85ba6e4
Autor:
Miriam Di Ianni, Giovanna Varricchio
Publikováno v:
Algorithms, Vol 13, Iss 2, p 32 (2020)
It is well-documented that social networks play a considerable role in information spreading. The dynamic processes governing the diffusion of information have been studied in many fields, including epidemiology, sociology, economics, and computer sc
Externí odkaz:
https://doaj.org/article/048dd40221864a89920d78ed5410e264
Autor:
Giovanna Varricchio, Miriam Di Ianni
Publikováno v:
Algorithms
Volume 13
Issue 2
Algorithms, Vol 13, Iss 2, p 32 (2020)
Volume 13
Issue 2
Algorithms, Vol 13, Iss 2, p 32 (2020)
It is well-documented that social networks play a considerable role in information spreading. The dynamic processes governing the diffusion of information have been studied in many fields, including epidemiology, sociology, economics, and computer sc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3351e11fc97c86bbcb28e5936ab84607
Publikováno v:
Theoretical Computer Science. 613:94-114
Community detection in graphs aims at identifying modules within a network and, possibly, their hierarchical organization by only using the information encoded in the graph modeling the network. Generally speaking, a community in a network is a subse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7b12bde65a8d51643c0f6586dbc82e2
https://doi.org/10.1016/j.tcs.2015.11.034
https://doi.org/10.1016/j.tcs.2015.11.034
We want to reduce the diameter of a unit disk graph by adding as few nodes as possible.We prove the NP-hardness of the problem.We provide a bi-criteria logarithmic approximation algorithm for the general case.We provide a bi-criteria constant approxi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae44dca86c703f5c257339c7d316fa49
http://hdl.handle.net/2108/114928
http://hdl.handle.net/2108/114928
Autor:
Miriam Di Ianni, Tiziana Calamoneri
Publikováno v:
Journal of Parallel and Distributed Computing. 63:1017-1025
In this paper we propose compact routing schemes having space and time complexities comparable to a 2-interval routing scheme for the class of networks decomposable as layered cross product (LCP) of rooted trees. As a consequence, we are able to desi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b3df55dece4703de66146996f23e836
https://doi.org/10.1016/s0743-7315(03)00110-2
https://doi.org/10.1016/s0743-7315(03)00110-2
Publikováno v:
Theoretical Computer Science. 299:751-761
Given a set N of radio stations located on an Euclidean space, a source station s and an integer h (1 ≤ h ≤ |N| - 1), the minimum bounded-hop broadcast range assignment problem consists in finding a range assignment for N of minimum total power c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::890cc09513fce18b2aa145af3f708d99
https://doi.org/10.1016/s0304-3975(02)00538-8
https://doi.org/10.1016/s0304-3975(02)00538-8
Autor:
Miriam Di Ianni
Publikováno v:
Parallel Processing Letters. 10:295-303
Deadlock prevention is usually realized by forbidding transmissions that could eventually cause a deadlock to occur. However, an optimal routing algorithm with respect to channel utilization forbids transmissions only when they would bring the networ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6859979d3fc6a773a363508554988b4
https://doi.org/10.1142/s0129626400000287
https://doi.org/10.1142/s0129626400000287