Optimal Gathering Protocols on Paths under Interference Constraints (2009)
Bermond, Jean-Claude, Correa, Ricardo, Yu, Min-Li
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...
Optimal Gathering Protocols on Paths under Interference Constraints (2009)
Bermond, Jean-Claude, Correa, Ricardo, Yu, Min-Li
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...
Optimal Gathering Protocols on Paths under Interference Constraints (2009)
Bermond, Jean-Claude, Correa, Ricardo, Yu, Min-Li
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...
Optimal Gathering Protocols on Paths under Interference Constraints (2009)
Bermond, Jean-Claude, Correa, Ricardo, Yu, Min-Li
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...
Jean-claude Bermond, David Coudert, Mascotte Cnrs-is-inria, Antipolis Cedex, Min-li Yu
This paper 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...
Vertex disjoint routings of cycles over tori (2007)
Bermond, Jean-Claude, Yu, Min-Li
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...
Vertex disjoint routings of cycles over tori (2007)
Bermond, Jean-Claude, Yu, Min-Li
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...
Vertex disjoint routings of cycles over tori (2007)
Bermond, Jean-Claude, Yu, Min-Li
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...
Vertex disjoint routings of cycles over tori (2007)
Bermond, Jean-Claude, Yu, Min-Li
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...
On DRC-covering of Kn by cycles (2003)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
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...
On DRC-covering of Kn by cycles (2003)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
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...
On DRC-covering of Kn by cycles (2003)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
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...
On DRC-covering of Kn by cycles (2003)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
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...
(d,1)-total labelling of graphs (2002)
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$...
(d,1)-total labelling of graphs (2002)
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$...
(d,1)-total labelling of graphs (2002)
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$...
(d,1)-total labelling of graphs (2002)
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$...
(d,1)-total labelling of graphs (2002)
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$...
On DRC-Covering of K_n by Cycles (2001)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
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...
On DRC-Covering of K_n by Cycles (2001)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
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...
On DRC-Covering of K_n by Cycles (2001)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
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...
On DRC-Covering of K_n by Cycles (2001)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
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...
Tree decompositions of complete graphs--[microform]. (1993)
University Microfilms order no. UMI00391350.
Resolvable path designs of complete graphs [microform] / (1989)
Thesis (M. Sc.)--Simon Fraser University, 1987.