Definition: A maximal subset of edges of a connected graph such that the corresponding induced subgraph cannot be disconnected by deleting any vertex.
See also connected components, biconnected graph.
Note: That is, the subgraph is biconnected or has no cut vertex. From Algorithms and Theory of Computation Handbook, page 6-6, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Tue May 6 13:48:55 2014.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "biconnected component", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/biconnectedComponent.html