Pages that link to "Matching (graph theory)"
Jump to navigation
Jump to search
The following pages link to Matching (graph theory):
Displaying 50 items.
- Algebraic geometry (← links)
- Graph theory (← links)
- Travelling salesman problem (← links)
- Minimum spanning tree (← links)
- Linear programming (← links)
- Perfect matching (← links)
- Big O notation (← links)
- Metcalfe's law (← links)
- Complete graph (← links)
- Assignment problem (← links)
- Chinese postman problem (← links)
- Hall's marriage theorem (← links)
- Matroid (← links)
- Bipartite graph (← links)
- Combinatorial optimization (← links)
- Graph coloring (← links)
- Independent set (graph theory) (← links)
- Approximation algorithm (← links)
- Unimodular matrix (← links)
- Perfect graph (← links)
- Line graph (← links)
- Stable marriage problem (← links)
- Edge coloring (← links)
- Network theory (← links)
- Degree (graph theory) (← links)
- Search problem (← links)
- Induced subgraph (← links)
- List of NP-complete problems (← links)
- Dominating set (← links)
- Domatic number (← links)
- Maximal independent set (← links)
- Greek letters used in mathematics, science, and engineering (← links)
- Secretary problem (← links)
- Set packing (← links)
- Saturation (graph theory) (← links)
- Hungarian algorithm (← links)
- Tutte polynomial (← links)
- Edge cover (← links)
- Jacobi eigenvalue algorithm (← links)
- Kőnig's theorem (graph theory) (← links)
- Maximum cardinality matching (← links)
- Maximum weight matching (← links)
- Minimum-cost flow problem (← links)
- Birkhoff polytope (← links)
- Rado graph (← links)
- Cactus graph (← links)
- Domino tiling (← links)
- Threshold graph (← links)
- Rook polynomial (← links)
- Hosoya index (← links)