Vertex links and the Grushko decomposition

We develop an algorithm of polynomial time-complexity to construct the Grushko decomposition of groups belonging to a class of CAT(0)-cubical groups, typically amalgamated products of free groups over cyclic subgroups. We impose a strong connectivity condition on vertex links, first studied by Brady and Meier, to obtain our result.