An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs

Y. Daniel Liang, Chongkye Rhee. An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs. In ACM Conference on Computer Science. pages 104-108, 1995. [doi]

@inproceedings{LiangR95,
  title = {An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs},
  author = {Y. Daniel Liang and Chongkye Rhee},
  year = {1995},
  doi = {10.1145/259526.259544},
  url = {http://doi.acm.org/10.1145/259526.259544},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LiangR95},
  cites = {0},
  citedby = {0},
  pages = {104-108},
  booktitle = {ACM Conference on Computer Science},
}