Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs (Q2848226)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
scientific article

    Statements

    Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 September 2013
    0 references
    graph algorithms
    0 references
    matchings
    0 references
    bipartite regular graphs
    0 references
    Birkhoff-von Neumann decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references