Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
Finding all maximally-matchable edges in a bipartite graph
Tamir Tassa
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Finding all maximally-matchable edges in a bipartite graph'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bipartite Graph
100%
Time Complexity
75%
Maximum Matching
75%
General Graphs
25%
Randomized Algorithms
25%
Linear Time
25%
Easy-to-implement
25%
Rabin
25%
Dense Graphs
25%
Computer Science
Bipartite Graph
100%
Time Complexity
75%
Maximum Matching
75%
Randomized Algorithm
25%
Mathematics
Edge
100%
Bipartite Graph
100%
Linear Time
25%