Pages that link to "Item:Q4973885"
From MaRDI portal
The following pages link to Exact Perfect Matching in Complete Graphs (Q4973885):
Displayed 4 items.
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- A weighted perfect matching with constraints on weights of its parts (Q5100129) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs (Q6179437) (← links)