treewidth_branch_and_bound(G[, …]) |
Computes the treewidth of a graph G and a corresponding perfect elimination ordering. |
minor_min_width(G) |
Computes a lower bound on the treewidth of G. |
min_width_heuristic(G) |
Computes an upper bound on the treewidth of a graph based on the min-width heuristic for the elimination ordering. |
min_fill_heuristic(G) |
Computes an upper bound on the treewidth of a graph based on the min-fill heuristic for the elimination ordering. |
is_simplicial(G, n) |
Determines whether a node n in G is simplicial. |
is_almost_simplicial(G, n) |
Determines whether a node n in G is almost simplicial. |