On the Strongly Connected and Biconnected Components of the Complement of Graphs.

Stavros D. Nikolopoulos Leonidas Palios

Published in: Electron. Notes Discret. Math. (2004)

Keyphrases

strongly connected
directed graph
optimum path forest
undirected graph
building blocks
connected components
graph theoretic
subgraph isomorphism