1067 search results - page 28 / 214 » Probabilistic regular graphs |
115
click to vote
ACSC
2005
IEEE
15 years 6 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
96
Voted
JCT
1998
15 years 3 days ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
87
Voted
COMBINATORICS
2007
15 years 13 days ago
2007
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
82
Voted
VLDB
1989
ACM
15 years 4 months ago
1989
ACM
We consider the following problem: given a labelled directedgraphG anda regularexpressionR, find all pairs of nodesconnectedby a simplepathsuchthattheconcatenationof thelabelsalon...
122
Voted
AAAI
2012
13 years 2 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...