[Graph] what is maximal subgraph

314 views
Skip to first unread message

shripad sarade

unread,
Feb 9, 2010, 2:13:10 AM2/9/10
to vani_gat...@googlegroups.com
What is maximal subgraph?

from Cormen I understood biconnected components and articulation point.
But I am still confused about Maximal subgraph.
If possible please give some example.

harshjpathak

unread,
Feb 9, 2010, 9:36:51 PM2/9/10
to vani_gat...@googlegroups.com
I have not looked up the book , but what i think is that it means a maximal connected subgraph. So it essentially means a clique. That is a subgraph of a graph with max number of vertices , and theres a edge between each of the vertex. Hope i am correct

harshjpathak

unread,
Feb 9, 2010, 11:21:06 PM2/9/10
to vani_gat...@googlegroups.com
okay i think this is the concept. A biconnected graph is a connected graph with no articulation points. On the other hand a bi-connected component is a maximal bi-connected subgraph. That is , it is a biconnected graph and it has maximum number of vertices.  There is a linear time algorithm to compute components. It is based on DFS.
Reply all
Reply to author
Forward
0 new messages