Sciweavers

45 search results - page 1 / 9
» A Fast Algorithm for Enumerating Bipartite Perfect Matchings
Sort
View
STACS
2007
Springer
13 years 11 months ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
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...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
COCO
2010
Springer
131views Algorithms» more  COCO 2010»
13 years 2 months ago
On the Matching Problem for Special Graph Classes
An even cycle in a graph is called nice by Lov
Thanh Minh Hoang