An economical algorithm for distinguishing blocks in a graph

@inproceedings{Dinits1974AnEA,
  title={An economical algorithm for distinguishing blocks in a graph},
  author={E. A. Dinits and M A Zaĭtsev and Alexander V. Karzanov},
  year={1974}
}
Abstract AN ALGORITHM for organizing the search for blocks in a connected graph is presented. The estimate of the number of operations of the algorithm is of minimum possible order: O ( p ), where p is the number of arcs of the graph.