Login / Signup
Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees.
Atsuko Yamaguchi
Hiroshi Mamitsuka
Published in:
ISAAC (2003)
Keyphrases
</>
connected components
spanning tree
undirected graph
edge disjoint
graph mining
minimum total cost
leaf nodes
minimum spanning tree
total length
root node
polynomially bounded
minimum spanning trees
graph model
high dimensional
edge weights
graph structure
graph theory
probabilistic model