YU , Min-Li

A $(d,1)$-total labelling of a graph $G$ is an assignment of integers to $V(G)\cup E(G)$ such that: (i) any two adjacent vertices of $G$ receive distinct integers, (ii) any two adjacent edges of $G$ receive distinct integers, and (iii) a vertex and its incident edge receive integers that differ by at least $d$ in absolute value. The {\it span}...

We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consider here the case when the physical network is $T(n)$, a torus of size $n$ by $n$, the subnetworks are cycles and the communication scheme is all-to-all or total...

We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network, a message can only be properly received if there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where...

We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network, a message can only be properly received if there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where...

In the gathering problem, a particular node in a graph, the base station , aims at receiving messages from some nodes in the graph. At each step, a node can send one message to one of its neighbors (such an action is called a call ). However, a node cannot send and receive a message during the same step. Moreover, the communication is...

In the gathering problem, a particular node in a graph, the base station, aims at receiving messages from some nodes in the graph. At each step, a node can send one message to one of its neighbor (such an action is called a call). However, a node cannot send and receive a message during the same step. Moreover, the communication is subjet to...

We study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference constraints. In such a network, a node is able to send messages to other nodes within reception distance, but doing so it might create interference with other communications. Thus, a...

This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on INF-networks which are protected independently from each other. The problem can be stated as follows: for a given graph G, find a cycle covering of the edge set of Kn, where V(Kn) = V(G), such that each...

We study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference constraints. In such a network, a node is able to send messages to other nodes within reception distance, but doing so it might create interference with other communications. Thus, a...

This work considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each other. The problem can be stated as follows: for a given graph $G$, find a cycle covering of the edge set of $K_n$, where $V(K_n) = V(G)$, such...

We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-determined destination node under interference constraints which are modeled by an integer d 1, so that any node within distance d of a sender cannot receive calls from any other sender. A set of calls which do not interfere with each other is...

Improved bounds for the minimum gossiping time in mesh bus networks of arbitrary dimension for 1-port model are given. More precisely, the gossiping protocol consists of steps during which messages are sent via buses and at the end of the protocol, all the nodes should know all the information. Furthermore, during one step a bus can carry at...

The Grundy index of a graph G = (V, E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the Grundy index of a graph G = (V, E) is NP-hard for general graphs. We also show that this problem is polynomial-time solvable for caterpillars. More specifically, we prove...

The Grundy index of a graph G = (V,E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the Grundy index of a graph G = (V,E) is NP-hard for general graphs. We also show that this problem is polynomial-time solvable for caterpillars. More specifically, we prove that...

In wavelength division multiplexing for unidirectional rings, traffic grooming is used to pack low rate signals into higher rate streams to share a wavelength. The grooming chosen determines the number of add-drop multiplexers used for the optical-to-electronic conversion. The determination of groomings to use the fewest multiplexers is...