Find a perfect bisimplicial ordering in a faster algorithm

edit

A bipartite graph is chordal bipartite if each cycle of length at least 6 has a chord. My question as shown in https://github.com/sagemath/sage/issu...

I write a brute-force search for finding perfect bisimplicial ordering on chordal bipartite graphs.