By integrating wireless, video, speech and real-time data access technologies, a unique
shopping assistant service can be created that personalizes the attention provided to a …

The current fixed spectrum allocation scheme leads to low spectrum utilization across the
whole spectrum. It requires a more effective spectrum allocation and utilization policy, which …

Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring,
maximal matching, maximal independent set, etc., is a long-standing challenge in distributed …

Co‐channel interference is the most critical of all interference that occurs in cellular radio.
The same channel cannot be assigned to two users that are connected to the same or to two …

The Long Term Evolution (LTE) system, and especially its current release, LTE-Advanced, is
considered as the next step in mobile broadband networks. Two of the main challenges …

We deal with the problem of frequency assignment in mobile and general radio networks,
where the signal interferences are modeled using an interference graph G. Our approach …

We show that List Colouring can be solved on $ n $-vertex trees by a deterministic Turing
machine using $ O (\log n) $ bits on the worktape. Given an $ n $-vertex graph $ G=(V, E) …

List edge and list total coloring of planar graphs with maximum degree 8 | SpringerLink Skip to
main content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search …

Distance constrained labeling problems, eg, L (p, q)-labeling and (p, q)-total labeling, are
originally motivated by the frequency assignment. From the viewpoint of theory, the upper …

Given a graph G=(V, E) and a list of available colors L (v) for each vertex v\in V, where L
(v)\subseteq {1, 2,..., k}, List k-Coloring refers to the problem of assigning colors to the …