Miklós Bartha, Miklós Krész. A Depth-first Algorithm to Reduce Graphs in Linear Time. In Stephen M. Watt, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Daniela Zaharie, editors, 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2009, Timisoara, Romania, September 26-29, 2009. pages 273-281, IEEE Computer Society, 2009. [doi]
@inproceedings{BarthaK09,
title = {A Depth-first Algorithm to Reduce Graphs in Linear Time},
author = {Miklós Bartha and Miklós Krész},
year = {2009},
doi = {10.1109/SYNASC.2009.48},
url = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2009.48},
researchr = {https://researchr.org/publication/BarthaK09},
cites = {0},
citedby = {0},
pages = {273-281},
booktitle = {11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2009, Timisoara, Romania, September 26-29, 2009},
editor = {Stephen M. Watt and Viorel Negru and Tetsuo Ida and Tudor Jebelean and Dana Petcu and Daniela Zaharie},
publisher = {IEEE Computer Society},
isbn = {978-1-4244-5910-0},
}