On-line maintenance of the four-connected components of a graph
Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, J. Chen · 2002
Given a graph G with n vertices and m edges, a k-connectivity query for vertices v' and v" of G asks whether there exist k disjoint paths between v' and v". The authors consider the problem of performing k-connectivity queries for k>