I write a brute-force search for finding perfect bisimplicial ordering on chordal bipartite graphs. The question as shown in https://github.com/sagemath/sage/issues/38792I write a brute-force search for finding perfect bisimplicial ordering on chordal bipartite graphs.
Revision history [back]
 | 1 | initial version |
Find a perfect bisimplicial ordering in a faster algorithm
Find a perfect bisimplicial ordering in a faster algorithm
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/issues/38792
I write a brute-force search for finding perfect bisimplicial ordering on chordal bipartite graphs. The question as shown in https://github.com/sagemath/sage/issues/38792I graphs.I write a brute-force search for finding perfect bisimplicial ordering on chordal bipartite graphs.
Find a perfect bisimplicial ordering in a faster algorithm
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/issues/38792
https://github.com/sagemath/sage/issues/38792
I write a brute-force search for finding perfect bisimplicial ordering on chordal bipartite graphs.I write a brute-force search for finding perfect bisimplicial ordering on chordal bipartite graphs.
