632 search results - page 95 / 127 » On Routing in Circulant Graphs |
150
click to vote
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
151
click to vote
SOFSEM
2007
Springer
15 years 11 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
159
click to vote
VALUETOOLS
2006
ACM
15 years 11 months ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
161
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
148
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...