Bingbing Zhuang, Hiroshi Nagamochi. Constant Time Generation of Biconnected Rooted Plane Graphs. In Der-Tsai Lee, Danny Z. Chen, Shi Ying, editors, Frontiers in Algorithmics, 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings. Volume 6213 of Lecture Notes in Computer Science, pages 113-123, Springer, 2010. [doi]
@inproceedings{ZhuangN10, title = {Constant Time Generation of Biconnected Rooted Plane Graphs}, author = {Bingbing Zhuang and Hiroshi Nagamochi}, year = {2010}, doi = {10.1007/978-3-642-14553-7_13}, url = {http://dx.doi.org/10.1007/978-3-642-14553-7_13}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/ZhuangN10}, cites = {0}, citedby = {0}, pages = {113-123}, booktitle = {Frontiers in Algorithmics, 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings}, editor = {Der-Tsai Lee and Danny Z. Chen and Shi Ying}, volume = {6213}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-14552-0}, }