296 search results - page 22 / 60 » Approximate Discovery of Random Graphs |
COMBINATORICA
2007
14 years 9 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
RSA
2008
14 years 9 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
110
click to vote
ESA
2011
Springer
13 years 9 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we study the vaccination of graphs against the outbreak of infectious diseases, in the following natural model generalizing a model by Aspnes et al.: An infectious ...