Abstract
We present an O(n) time algorithm for finding biconnected components in permutation graphs. The best known algorithm for this problem takes O(m + n) time in a general graph of n vertices and m edges.
| Original language | English |
|---|---|
| Pages | 104-108 |
| Number of pages | 5 |
| DOIs | |
| State | Published - 1995 |
| Event | Proceedings of the 1995 ACM Computer Science Conference - Nashvile, TN, USA Duration: Feb 28 1995 → Mar 2 1995 |
Conference
| Conference | Proceedings of the 1995 ACM Computer Science Conference |
|---|---|
| City | Nashvile, TN, USA |
| Period | 02/28/95 → 03/2/95 |
Scopus Subject Areas
- Hardware and Architecture