This function is a polynomial time algorithm for checking the morality of undirected graphs with maximum degree 4. The algorithm has been proved to be correct. It either removes a simplicial node or a simplicial clique, depending on situations like node degree, and K3 stack length etc.
1 | d_wrs_deg4(G, debug = F)
|
G |
A given undirected graph stored in an adjacency matrix format. |
debug |
A boolean argument to show steps of the backtracking algorithm. |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.