1 paper
Zihan Zhou, Shuchao Li
Given a graph G, a subset of vertices is called a maximum dissociation set of G if it induces a subgraph with vertex degree at most 1, and the subset has maximum cardinality. T…