Find a perfect bisimplicial ordering in a faster algorithm

graph
graph-theory

licheng
311 ●6 ●25 ●43

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.

add a comment

Be the first one to answer this question!

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower

Stats

Asked: 0 years ago

Seen: 118 times

Last updated: Oct 11 '24

Related questions

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.

Find a perfect bisimplicial ordering in a faster algorithm savecancel

Be the first one to answer this question!

Question Tools

Stats

Related questions

Find a perfect bisimplicial ordering in a faster algorithm