Combinatorial Optimization
Explore discrete structures; network algorithms; complexity and approximations. Concepts and connections are available independently of video coverage.
FOLLOW AN IDEA
Graph matchings
A matching is a set of edges with no shared endpoints.
Explore concept graph · Explore connected videos
Different ways to understand it
No reviewed video yet. Explore the concept in a map or suggest a resource. Suggest a video
More concepts to explore
Bipartite matching
Matching in a two-part graph pairs vertices across parts without shared endpoints.
Euler and Hamilton paths
Euler paths traverse each edge once; Hamilton paths visit each vertex once.
Graph Laplacian
For a simple undirected graph, degree matrix minus adjacency matrix encodes connectivity and diffusion.
Graphs
Vertices and edges model connections, with directed and undirected variants.
Matroids
A matroid abstracts independence through hereditary and exchange axioms.
Knowledge connections
- Minimum spanning tree · Related · Map context
- Matroids · Related · Map context
- Bipartite matching · Next concept · Map context
- Bipartite matching · Related · Map context
- Graph Laplacian · Related · Map context
- Euler and Hamilton paths · Related · Map context
- Graphs · Related · Map context
Appears in these maps
Graph Theory
Explore graph structures; paths, coloring and planarity; networks and spectral viewpoints. Concepts and connections are available independently of video coverage.