28 search results - page 3 / 6 » Partitioning graphs of supply and demand |
AIEDAM
2007
13 years 6 months ago
2007
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....
CIAC
2010
Springer
13 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...
EPEW
2005
Springer
13 years 11 months ago
2005
Springer
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
ASUNAM
2011
IEEE
12 years 6 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...