65 search results - page 12 / 13 » Finding maximum degrees in hidden bipartite graphs |
COMBINATORICS
2000
13 years 8 months ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
BMCBI
2010
13 years 8 months ago
2010
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
JCO
2006
13 years 8 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
NIPS
2007
13 years 10 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...