An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs


We present an 0 (n) time algorithm for jinding biconnected components in permutation graphs. The best known algorithm for this problem takes 0 (m + n) time in a general gruph of n vertices und m edges. 
DOI: 10.1145/259526.259544


2 Figures and Tables

Slides referencing similar topics