Pages that link to "Item:Q1242177"
From MaRDI portal
The following pages link to Testing for Equality between Maximum Matching and Minimum Node Covering (Q1242177):
Displayed 4 items.
- Uniquely solvable quadratic Boolean equations (Q1070255) (← links)
- A switching algorithm for the solution of quadratic Boolean equations (Q1153123) (← links)
- Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
- An efficiently solvable graph partition problem to which many problems are reducible (Q2365814) (← links)