Login / Signup
Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial.
Farley Soares Oliveira
Hidefumi Hiraishi
Hiroshi Imai
Published in:
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2019)
Keyphrases
</>
spanning tree
edge disjoint
minimum spanning tree
minimum cost
minimum weight
undirected graph
minimum spanning trees
weighted graph
edge weights
high level
depth first search
leaf nodes
np hard
boolean functions
directed acyclic graph
data sources
root node