153 search results - page 22 / 31 » Edge Disjoint Paths in Moderately Connected Graphs |
ICAI
2010
13 years 5 months ago
2010
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
ALGORITHMICA
2002
13 years 7 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
CCR
2004
13 years 7 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
PODC
2003
ACM
14 years 24 days ago
2003
ACM
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...