... maximum 1-restricted 2-matching As a corollary to the validity of the algorithm, we also show that in every graph there always exists a maximum 2-matching that can be transformed into a maximum 1-restricted ... Furthermore, optimal solutions produced by this simpler algorithm need not be optimal solutions to the node-max 2-piece packing problem, hence the simpler algorithm is clearly different from the ... follow They characterize the maximum size of a 1-restricted 2matching and the difference between the maximum sizes of a maximum 2-matching and a maximum 1-restricted 2-matching the electronic journal...