Pages that link to "Item:Q1853135"
From MaRDI portal
The following pages link to A simple matching algorithm for regular bipartite graphs. (Q1853135):
Displaying 9 items.
- A perfect matching algorithm for sparse bipartite graphs (Q759771) (← links)
- A simple algorithm for edge-coloring bipartite multigraphs (Q1007547) (← links)
- Space-efficient Euler partition and bipartite edge coloring (Q1628587) (← links)
- Maximum matching in regular and almost regular graphs (Q1949755) (← links)
- Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs (Q2322505) (← links)
- Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs (Q2848226) (← links)
- Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs (Q2875130) (← links)
- Space-Efficient Euler Partition and Bipartite Edge Coloring (Q5283378) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902507) (← links)