Biconnectivity on Symbolically Represented Graphs: A Linear Solution

Raffaella Gentilini, Alberto Policriti. Biconnectivity on Symbolically Represented Graphs: A Linear Solution. In Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono, editors, Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings. Volume 2906 of Lecture Notes in Computer Science, pages 554-564, Springer, 2003. [doi]

@inproceedings{GentiliniP03,
  title = {Biconnectivity on Symbolically Represented Graphs: A Linear Solution},
  author = {Raffaella Gentilini and Alberto Policriti},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2906&spage=554},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GentiliniP03},
  cites = {0},
  citedby = {0},
  pages = {554-564},
  booktitle = {Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
  editor = {Toshihide Ibaraki and Naoki Katoh and Hirotaka Ono},
  volume = {2906},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-20695-7},
}