45 search results - page 4 / 9 » A Fast Algorithm for Enumerating Bipartite Perfect Matchings |
PKDD
2005
Springer
15 years 3 months ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
78
Voted
DAM
2002
14 years 9 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
STACS
2004
Springer
15 years 2 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
ORL
2008
14 years 9 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
ASAP
2008
IEEE
14 years 11 months ago
2008
IEEE
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...