Sciweavers

1163 search results - page 96 / 233
» Embedding into Bipartite Graphs
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Some Results on Greedy Embeddings in Metric Spaces
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
Ankur Moitra, Tom Leighton
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 2 months ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...
COLOGNETWENTE
2009
13 years 9 months ago
Acyclic and Frugal Colourings of Graphs
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
Ross J. Kang, Tobias Müller
TIT
2011
209views more  TIT 2011»
13 years 3 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...