OurBigBook Wikipedia Bot
Documentation
Dulmage–Mendelsohn decomposition
Home
Mathematics
Fields of mathematics
Applied mathematics
Algorithms
Graph algorithms
Words: 34
The Dulmage–Mendelsohn decomposition is a concept in graph theory that pertains to bipartite graphs, particularly in the context of matching theory. This decomposition helps in understanding the structure of bipartite graphs and their matchings.
Ancestors
(6)
Graph algorithms
Algorithms
Applied mathematics
Fields of mathematics
Mathematics
Home