A BSP/CGM Algorithm for Computing Euler Tours in Graphs

Edson Cáceres, C. Y. Nasu. A BSP/CGM Algorithm for Computing Euler Tours in Graphs. In 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2003), 10-12 November 2003, Sao Paulo, Brazil. pages 175-182, IEEE Computer Society, 2003. [doi]

@inproceedings{CaceresN03,
  title = {A BSP/CGM Algorithm for Computing Euler Tours in Graphs},
  author = {Edson Cáceres and C. Y. Nasu},
  year = {2003},
  url = {http://csdl.computer.org/comp/proceedings/sbac-pad/2003/2046/00/20460175abs.htm},
  tags = {graph-rewriting, C++, rewriting},
  researchr = {https://researchr.org/publication/CaceresN03},
  cites = {0},
  citedby = {0},
  pages = {175-182},
  booktitle = {15th  Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2003), 10-12 November 2003, Sao Paulo, Brazil},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-2046-4},
}