0% found this document useful (0 votes)
43 views2 pages

Articulation Point

An articulation point in a graph is a node whose removal would disconnect the graph or increase the number of connected components. This document provides two definitions for an articulation point in a depth-first search (DFS) tree: 1) a non-root node with at least two children whose depth-first search does not visit them, or 2) a root of the depth-first search tree with at least two children. It also describes using a "low" value, defined as the lowest depth reachable from the subtree, to identify articulation points.

Uploaded by

shubhangivs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
43 views2 pages

Articulation Point

An articulation point in a graph is a node whose removal would disconnect the graph or increase the number of connected components. This document provides two definitions for an articulation point in a depth-first search (DFS) tree: 1) a non-root node with at least two children whose depth-first search does not visit them, or 2) a root of the depth-first search tree with at least two children. It also describes using a "low" value, defined as the lowest depth reachable from the subtree, to identify articulation points.

Uploaded by

shubhangivs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Avertex is an articulation point if

0
if it's rootof dfs tree
O O
there exists two children
lo
T
I I notyeevisited nodes adjacent
0
0 to u

O
IO if it's not root
there exists abackedgee
from any descendants to
its ancestors

bymaintaining a lowvalue
which is the lowest depth a node
canreach

to o
O o
I depth of the node
ol e no 5 tg
I l low value ofnode
E D ya.jo's kit 06
I
y lo u 07
i
0 its root with 2 children
G330 I O 14.4 l 5.7 it's notroot but thereexists
8
Eve 9 descendant such that

lower visitedEu
Et for point 1 low123 visitedEl
5 low163 visited153

7 Low183 visited17

You might also like