Revision history of "Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n" (Q2894465)
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.