T. Calamoneri

most citedMinimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2011

On relaxing the constraints in pairwise compatibility graphs

Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri

A graph $G$ is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{ma x}$ such that each leaf $…

cs.DM2009

The L(2, 1)-Labeling Problem on Oriented Regular Grids

Tiziana Calamoneri

The L(2, 1)-labeling of a digraph G is a function f from the node set of $G$ to the set of all nonnegative integers such that $∣ f (x) - f (y) ∣ \geq 2$ if $x$ and $y$ are at distance 1,…