1127 search results - page 5 / 226 » New Algorithms for Generalized Network Flows |
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
CIAC
2010
Springer
13 years 11 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...
BDIM
2008
IEEE
14 years 1 months ago
2008
IEEE
—Knowing the dependencies among computing assets and services provides insights into the computing and business landscape, therefore, facilitating low-risk timely changes in supp...
FOCS
1997
IEEE
13 years 11 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
AAAI
2010
13 years 8 months ago
2010
Diffusion processes taking place in social networks are used to model a number of phenomena, such as the spread of human or computer viruses, and the adoption of products in `vira...