Serafino Cicerone, Gabriele Di Stefano. On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. In Hon Wai Leong, Hiroshi Imai, Sanjay Jain, editors, Algorithms and Computation, 8th International Symposium, ISAAC 97, Singapore, December 17-19, 1997, Proceedings. Volume 1350 of Lecture Notes in Computer Science, pages 354-363, Springer, 1997.
@inproceedings{CiceroneS97,
title = {On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs},
author = {Serafino Cicerone and Gabriele Di Stefano},
year = {1997},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CiceroneS97},
cites = {0},
citedby = {0},
pages = {354-363},
booktitle = {Algorithms and Computation, 8th International Symposium, ISAAC 97, Singapore, December 17-19, 1997, Proceedings},
editor = {Hon Wai Leong and Hiroshi Imai and Sanjay Jain},
volume = {1350},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-63890-3},
}