-
1
-
-
0032673680
-
Assigning Codes in Wireless Networks: Bounds and Scaling Properties
-
R. Battiti, A.A. Bertossi, and M.A. Bonuccelli, "Assigning Codes in Wireless Networks: Bounds and Scaling Properties", Wireless Networks, Vol. 5, 1999, pp. 195-209.
-
(1999)
Wireless Networks
, vol.5
, pp. 195-209
-
-
Battiti, R.1
Bertossi, A.A.2
Bonuccelli, M.A.3
-
2
-
-
23044520219
-
Mappings for Conflict-Free Access of Paths in Elementary Data Structures
-
Sixth Annual Int'l Computing and Combinatorics Conference
-
A.A. Bertossi and M.C. Pinotti, "Mappings for Conflict-Free Access of Paths in Elementary Data Structures" Sixth Annual Int'l Computing and Combinatorics Conference, in LNCS 1858, 2000.
-
(2000)
LNCS
, vol.1858
-
-
Bertossi, A.A.1
Pinotti, M.C.2
-
3
-
-
0346681623
-
Approximation λ-Coloring on Graphs
-
H.L. Bodlaender, T. Kloks, R.B. Tan, and J. van Leeuwen, "Approximation λ-Coloring on Graphs", STACS, 2000.
-
(2000)
STACS
-
-
Bodlaender, H.L.1
Kloks, T.2
Tan, R.B.3
Van Leeuwen, J.4
-
4
-
-
0030367240
-
The L(2, 1)-Labeling Problem on Graphs
-
G. J. Chang and D. Kuo, "The L(2, 1)-Labeling Problem on Graphs", SIAM Journal on Discrete Mathematics, Vol. 9, 1996, pp. 309-316.
-
(1996)
SIAM Journal on Discrete Mathematics
, vol.9
, pp. 309-316
-
-
Chang, G.J.1
Kuo, D.2
-
5
-
-
0023363240
-
Distributed Nodes Organizations Algorithm for Channel Access in a Multihop Dynamic Radio Network
-
I. Chlamtac and S.S. Pinter, "Distributed Nodes Organizations Algorithm for Channel Access in a Multihop Dynamic Radio Network", IEEE Transactions on Computers, Vol. 36, 1987, pp. 728-737.
-
(1987)
IEEE Transactions on Computers
, vol.36
, pp. 728-737
-
-
Chlamtac, I.1
Pinter, S.S.2
-
8
-
-
0030172707
-
Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey
-
June
-
I. Katzela and M. Naghshineh, "Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey", IEEE Personal Communications, June 1996, pp. 10-31.
-
(1996)
IEEE Personal Communications
, pp. 10-31
-
-
Katzela, I.1
Naghshineh, M.2
-
9
-
-
0020765471
-
Optimal Approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem
-
S.T. McCormick, "Optimal Approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem", Mathematical Programming, Vol. 26, 1983, pp. 153-171.
-
(1983)
Mathematical Programming
, vol.26
, pp. 153-171
-
-
McCormick, S.T.1
-
10
-
-
0000380901
-
Labeling Chordal Graphs: Distance Two Condition
-
D. Sakai, "Labeling Chordal Graphs: Distance Two Condition", SIAM Journal on Discrete Mathematics, Vol. 7, 1994, pp. 133-140.
-
(1994)
SIAM Journal on Discrete Mathematics
, vol.7
, pp. 133-140
-
-
Sakai, D.1
-
11
-
-
0032332606
-
Graph Labelling and Radio Channel Assignment
-
J. Van den Heuvel, R. A. Leese, and M.A. Shepherd, "Graph Labelling and Radio Channel Assignment", Journal of Graph Theory, Vol. 29, 1998, pp. 263-283.
-
(1998)
Journal of Graph Theory
, vol.29
, pp. 263-283
-
-
Van Den Heuvel, J.1
Leese, R.A.2
Shepherd, M.A.3
|