45 search results - page 1 / 9 » Small Maximal Matchings in Random Graphs |
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
STOC
2010
ACM
13 years 9 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
NIPS
2001
13 years 6 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
RSA
2002
13 years 4 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...