Sciweavers

863 search results - page 11 / 173
» Links in edge-colored graphs
Sort
View
PODC
2010
ACM
14 years 15 days ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
IPMU
2010
Springer
13 years 10 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
AINA
2008
IEEE
13 years 10 months ago
Formalization of Link Farm Structure Using Graph Grammar
A link farm is a set of web pages constructed to mislead the importance of target pages in search engine results by boosting their link-based ranking scores. In this paper, we int...
Kiattikun Chobtham, Athasit Surarerks, Arnon Rungs...
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 2 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 8 months ago
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
N. Praneeth Kumar, Ashutosh Deepak Gore, Abhay Kar...