Worst-case analysis of a dynamic channel assignment strategy (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
Channel assignment and graph labeling
Handbook of wireless networks and mobile computing
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
Discrete Mathematics - Algebraic and topological methods in graph theory
On generalized Petersen graphs labeled with a condition at distance two
Discrete Mathematics
Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Distance Constrained Labeling of Precolored Trees
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Frequency Channel Assignment on Planar Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Online and Offline Distance Constrained Labeling of Disk Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Distance-two labelings of graphs
European Journal of Combinatorics
Channel Assignment with Separation for Interference Avoidance in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Labeling trees with a condition at distance two
Discrete Mathematics
L(h,1)-labeling subclasses of planar graphs
Journal of Parallel and Distributed Computing
Worst-case analysis of a dynamic channel assignment strategy
Discrete Applied Mathematics
Distributive online channel assignment for hexagonal cellular networks with constraints
Discrete Applied Mathematics
On distance constrained labeling of disk graphs
Theoretical Computer Science
Optimal Channel Assignments for Lattices with Conditions at Distance Two
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
L(2, 1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Generalized list T-colorings of cycles
Discrete Applied Mathematics
A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
A bound on the chromatic number of the square of a planar graph
Journal of Combinatorial Theory Series B
Distance-two labelings of digraphs
Discrete Applied Mathematics
Extremal problems on consecutive L(2,1)-labelling
Discrete Applied Mathematics
An extremal problem on non-full colorable graphs
Discrete Applied Mathematics
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
Optimal frequency assignments of cycles and powers of cycles
International Journal of Mobile Network Design and Innovation
A game approach for multi-channel allocation in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On L(d,1)-labeling of Cartesian product of a cycle and a path
Discrete Applied Mathematics
Note: On hamiltonian colorings for some graphs
Discrete Applied Mathematics
A distance-labelling problem for hypercubes
Discrete Applied Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
Distance-two labellings of Hamming graphs
Discrete Applied Mathematics
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
A general approach to L(h,k)-label interconnection networks
Journal of Computer Science and Technology
Graph labellings with variable weights, a survey
Discrete Applied Mathematics
Notes: A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
Generalized list T-colorings of cycles
Discrete Applied Mathematics
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
L(2,1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Optimal radio labellings of complete m-ary trees
Discrete Applied Mathematics
Channel assignment for interference avoidance in honeycomb wireless networks
Journal of Parallel and Distributed Computing
New upper bounds on the L(2,1)-labeling of the skew and converse skew product graphs
Theoretical Computer Science
Distance constrained labelings of graphs of bounded treewidth
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the approximability of the L(h, k)-labelling problem on bipartite graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Elegant distance constrained labelings of trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A general framework for coloring problems: old results, new results, and open problems
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
On n-fold L(j,k)-and circular L(j,k)-labelings of graphs
Discrete Applied Mathematics
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Path covering number and L(2,1)-labeling number of graphs
Discrete Applied Mathematics
On (s,t)-relaxed L (2,1)-labelings of the square lattice
Information Processing Letters
Circular L(j,k)-labeling number of direct product of path and cycle
Journal of Combinatorial Optimization
List backbone colouring of graphs
Discrete Applied Mathematics
Multiple L(j,1)-labeling of the triangular lattice
Journal of Combinatorial Optimization
| Hi-index | 0.01 |
The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channel assignment. Vertices correspond to transmitter locations and their labels to radio channels. As a model for the way in which interference is avoided in real radio systems, each pair of vertices has, depending on their separation, a constraint on the difference between the labels that can be assigned. We consider the question of finding labelings of minimum span, given a graph and a set of constraints. The focus is on the infinite triangular lattice, infinite square lattice, and infinite line lattice, and optimal labelings for up to three levels of constraint are obtained. We highlight how accepted practice can lead to suboptimal channel assignments. © 1998 John Wiley & Sons, Inc. J Graph Theory 29: 263–283, 1998