We propose heuristics for approximating the maximum cardinality matching on undirected graphs. Our heuristics are based on the theoretical body of a certain type of random graphs, and are made practical for real-life ones. The idea is based on judiciously selecting a subgraph of a given graph and ob...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!