Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
45
search results - page 1 / 9
»
A Fast Algorithm for Enumerating Bipartite Perfect Matchings
Sort
relevance
views
votes
recent
update
View
thumb
title
23
click to vote
ISAAC
2001
Springer
94
views
Algorithms
»
more
ISAAC 2001
»
A Fast Algorithm for Enumerating Bipartite Perfect Matchings
14 years 2 months ago
Download
research.nii.ac.jp
Takeaki Uno
claim paper
Read More »
23
click to vote
ISAAC
1997
Springer
113
views
Algorithms
»
more
ISAAC 1997
»
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
14 years 1 months ago
Download
research.nii.ac.jp
Takeaki Uno
claim paper
Read More »
28
click to vote
STACS
2007
Springer
155
views
Theoretical Computer Science
»
more
STACS 2007
»
The Polynomially Bounded Perfect Matching Problem Is in NC 2
14 years 3 months ago
Download
www.cse.iitk.ac.in
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...
claim paper
Read More »
28
click to vote
COCO
2010
Springer
131
views
Algorithms
»
more
COCO 2010
»
On the Matching Problem for Special Graph Classes
13 years 7 months ago
Download
www.uni-ulm.de
An even cycle in a graph is called nice by Lov
Thanh Minh Hoang
claim paper
Read More »
25
click to vote
ESA
2004
Springer
92
views
Algorithms
»
more
ESA 2004
»
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
14 years 3 months ago
Download
rutcor.rutgers.edu
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
claim paper
Read More »
« Prev
« First
page 1 / 9
Last »
Next »