Labeling planar graphs with a condition at distance two
European Journal of Combinatorics
Distance constrained labelings of planar graphs with no short cycles
Discrete Applied Mathematics
Graph labellings with variable weights, a survey
Discrete Applied Mathematics
On injective colourings of chordal graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The L(h,1,1)-labelling problem for trees
European Journal of Combinatorics
Generalized powers of graphs and their algorithmic use
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On the computational complexity of the L(2,1)-labeling problem for regular graphs
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
On L(2,1)-coloring split, chordal bipartite, and weakly chordal graphs
Discrete Applied Mathematics
Computing square roots of trivially perfect and threshold graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
A "partial broadcast channel" enables one processor to send the same message---simultaneously and privately---to a fixed subset of processors. Suppose that a collection of processors are connected by an arbitrary network of partial broadcast channels ...