OpenAlex
PricingAboutJobs
Log inGet started
Work

Maximum Matchings via Gaussian Elimination

HTML

Year: 2004
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/focs.2004.40
Authors: M. Mucha, P. Sankowski
Institution: University of Warsaw
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: maximum matching, bipartite matching, perfect matchings, randomized algorithms, Gaussian elimination, matrix multiplication exponent, graph algorithms

Open Access status: closed
OpenAlex ID: W1494735819
FWCI: 7.308
Cites: 19
Cited by: 345
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms