On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs

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.

Abstract

Abstract is missing.