Bhubaneswar Mishra. An Efficient Algorithm to Find all Bidirectional Edges of an Undirected Graph. In 25th Annual Symposium on Foundations of Computer Science, 24-26 October 1984, Singer Island, Florida, USA. pages 207-216, IEEE, 1984.
@inproceedings{Mishra84:0, title = {An Efficient Algorithm to Find all Bidirectional Edges of an Undirected Graph}, author = {Bhubaneswar Mishra}, year = {1984}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Mishra84%3A0}, cites = {0}, citedby = {0}, pages = {207-216}, booktitle = {25th Annual Symposium on Foundations of Computer Science, 24-26 October 1984, Singer Island, Florida, USA}, publisher = {IEEE}, }