Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds