Testing for Equality between Maximum Matching and Minimum Node Covering
From MaRDI portal
Publication:1242177
DOI10.1016/0020-0190(77)90068-0zbMath0367.05056MaRDI QIDQ1242177
Publication date: 1977
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(77)90068-0
Related Items
Uniquely solvable quadratic Boolean equations, A switching algorithm for the solution of quadratic Boolean equations, Parallel maximum independent set in convex bipartite graphs, An efficiently solvable graph partition problem to which many problems are reducible
Cites Work