Revision history of "NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem" (Q860400)
From MaRDI portal
Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.
