Login / Signup
An Algorithm for Counting Spanning Trees in Labeled Molecular Graphs Homeomorphic to Cata-Condensed Systems.
P. E. John
Roger B. Mallion
Ivan Gutman
Published in:
J. Chem. Inf. Comput. Sci. (1998)
Keyphrases
</>
spanning tree
minimum spanning tree
times faster
learning algorithm
optimal solution
undirected graph
graph structure
matching algorithm
detection algorithm
computational complexity
dynamic programming
k means
minimum weight
expectation maximization
edge weights
minimum cost
np hard