109 search results - page 8 / 22 » Vertex Ranking with Capacity |
NETWORKS
2006
14 years 9 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
ALGORITHMICA
2010
14 years 9 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
71
Voted
PIMRC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—In multi-user multiple-input multiple-output (MUMIMO) systems, spatial multiplexing can be employed to increase the throughput without the need for multiple antennas and...
HEURISTICS
2000
14 years 9 months ago
2000
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...