CORR
2012
Springer
12 years 8 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
MOBIHOC
2007
ACM
15 years 8 days ago
2007
ACM
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...