Pages that link to "Item:Q4973885"
From MaRDI portal
The following pages link to Exact Perfect Matching in Complete Graphs (Q4973885):
Displaying 8 items.
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- Perfect matchings of cellular graphs (Q1915154) (← links)
- Perfect matchings after vertex deletions (Q2462373) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- Popular Matchings in Complete Graphs (Q5090952) (← links)
- A weighted perfect matching with constraints on weights of its parts (Q5100129) (← links)
- The ultimate categorical matching in a graph (Q5937440) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)