Matching (graph theory)
Top View
- Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms
- Hierarchical B-Matching
- I. Matchings and Coverings
- Exact Sampling from Perfect Matchings of Dense Nearly Regular Bipartite Graphs
- Kernelization of Packing Problems
- NP-Completeness (Chapter 8)
- Matching. Applications Vertex Cover Cover Is Upper Bound. ∑ Simple Example. Maximum Matching
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- 3-Dimensional Matching, Subset Sum Problems
- A 2K-Kernelization Algorithm for Vertex Cover Based on Crown
- Lecture 1: Basics, Bipartite Matching 1 P, NP, and NP-Complete
- Branch Decompositions and Their Applications
- Math 776 Graph Theory Lecture Notes 6 Matchings
- Matroids [Read Chapter 4 and 7 first.] Status: Needs Significant Revision Or Deletion Merge Into Greedy Notes As Hardsection?
- The Maximum Clique Problem: Algorithms, Applications, and Implementations
- 1. Lecture Notes on Bipartite Matching
- Characterizing Graphs of Maximum Matching Width at Most 2
- Exact Weight Perfect Matching of Bipartite Graph Is NP-Complete ∗