Login / Signup
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs.
Shin-ichi Nakayama
Shigeru Masuyama
Published in:
IEICE Trans. Inf. Syst. (2006)
Keyphrases
</>
spanning tree
graph isomorphism
undirected graph
minimum spanning tree
computational complexity
minimum weight
minimum cost
worst case
planar graphs
graph structure
probabilistic model
edge weights
graph matching
graph mining
graph databases
special case
graph search
objective function