45 search results - page 1 / 9 » A Fast Algorithm for Enumerating Bipartite Perfect Matchings |
78
Voted
ISAAC
2001
Springer
15 years 5 months ago
2001
Springer
80
Voted
ISAAC
1997
Springer
15 years 5 months ago
1997
Springer
108
Voted
STACS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
104
Voted
COCO
2010
Springer
14 years 10 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
78
Voted
ESA
2004
Springer
15 years 6 months ago
2004
Springer