Biconnected Components in a NanoCell

Based on this theorem, we formulated and proved Theorem 6.3, and implemented the following algorithm. 

Add a cycle among the nonfloating pins to create the graph G.  

Find the block containing all nonfloating, or active pins. 

Some definitions are necessary before presenting the next theorem. Let G be a graph and let x,U be such that Jce V G) and U C V(G). An x,U fan is a set of x,U paths such that any two of them intersect only at the node, X. Note that if X .U, then one of the paths can be the path of length 0 from x to The following theorem is useful in proving that the algorithm above works. 

Theorem 6.3 proves that this algorithm works. 

---