Link scheduling directed graphs using undirected edge colours
Communication in a wireless network is typically modeled as either a directed or an undirected communication graph. Link scheduling is the problem of assigning time slots to each edge so that communication on every edge at its assigned time may occur without interference. Interference is also modele...
Main Author: | d'Oliveira, Kyle |
---|---|
Language: | English |
Published: |
University of British Columbia
2012
|
Online Access: | http://hdl.handle.net/2429/42329 |
Similar Items
-
Link scheduling directed graphs using undirected edge colours
by: d'Oliveira, Kyle
Published: (2012) -
Link scheduling directed graphs using undirected edge colours
by: d'Oliveira, Kyle
Published: (2012) -
The search for minimal edge 1-extension of an undirected colored graph
by: Razumovsky, Peter Vladimirovich
Published: (2021-08-01) -
On the Metric Dimension of Directed and Undirected Circulant Graphs
by: Vetrík Tomáš
Published: (2020-02-01) -
A Hierarchical Poisson Model for Community Detection of Undirected Single-edge Graphs
by: Lin, Yu-Ying, et al.
Published: (2016)