Revision history of "Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth" (Q2444525)
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.
