Scribd
Upload
63 views30 pages

Chapter 6.1 Biconnected Components

Uploaded by

hardikprajapati1214
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
63 views30 pages

Chapter 6.1 Biconnected Components

Uploaded by

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

Biconnected Components

and
Articulation Point
Biconnected Components
• A node V of a connected graph is an
articulation point if the sub graph obtained by
deleting V and all edges incident to V is no
longer connected.
OR
• A node V in a connected graph is an
articulation point if and only if deletion of
vertex V with all edges incident to V divides
the graph into two or more nonempty
components.
• A given graph G is biconnected only when it
contain no articulation point.

1 2

5 3

4
Articulation Point in Graph
• In a graph G(V,E) , v is an articulation point if
1. Removal of v in G result in a disconnected
graph.
2. If v is an articulation point, then there exist
distinct vertices w and x such that v is in
every path from w to x.
Articulation Point
Articulation Point
Algorithm to find A.P.
1. Do depth first search on graph from any
node.
Let T be the tree generated by DFS and for
each node v of the graph.
let Prenum(Discovery time) of v be the
number assigned by search.
2. Traverse the tree T in post order for each
visited node v calculate lowest of v as
minimum of
a. Prenum of v
b. Prenum of w for each node w such that
their exists an edge <v,w> ϵ G that has no
corresponding edge in T.
c. Lowest[x] for every child x and v in T.
Graph
Graph and DFS Tree
Graph, DFS tree and Missing edges
Apply Post order Traversal

6 5 2 3 4 1
Lowest[6] = Min{prenum[6],prenum[3]}
= Min{5,3}
=3
3

Lowest[5] = Min{prenum[5],lowest[6]}
= Min{4,3}
=3
3 1

Lowest[2] = Min{prenum[2],prenum[1]}
= Min{6,1}
=1
3 1

3
Lowest[3] = Min{prenum[3],prenum[6],lowest[5],
lowest[2]}
= Min{3,5,3,1}
=1
1

3 1

3
Lowest[4] = Min{prenum[4],lowest[3]}
= Min{2,1}
=1
1

3 1

3
Lowest[1] = Min{prenum[1],prenum[2],lowest[4]}
= Min{1,6,1}
=1
1

3 1

3
1

3 1

3
• Articulation is determined as follows:
1. Root[T] is an articulation point if and only if it
has more than one child.
2. A node v other than Root[T] is an articulation
point of G if and only if
v has a child x such that
Lowest x (child) >= prenum v (parent)
if yes than parent is an articulation point.
Find an Articulation Point(s) from the below
graph.
• Node 1 and 4

You might also like