biconnected components
Description: Maximal subgraphs of a graph that remain connected after removal of any single vertex, studied in graph theory and algorithms.
Primary topic: Complexity and Algorithms in Graphs (34%)
Wikidata ID: wiki/Q25439959
OpenAlex ID: keywords/biconnected-components
