AI helps you reading Science
AI generates interpretation videos
AI extracts and analyses the key points of the paper to generate videos automatically
AI parses the academic lineage of this thesis
Some Matching Problems
ICALP, pp.258-268, (1977)
In certain applications it is required to find in a bipartite graph a perfect matching which satisfies some additional properties. For one such type of restrictions the problem is proven to be NP-complete. If for a given subset of edges no more than r edges may be included in the matching then an O(ne) algorithm is suggested.
PPT (Upload PPT)