Login / Signup
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs.
Shin-ichi Nakayama
Shigeru Masuyama
Published in:
Inf. Process. Lett. (2007)
Keyphrases
</>
graph isomorphism
computational complexity
planar graphs
graph mining
spanning tree
graph structure
subgraph isomorphism
weighted graph
worst case
k means
optimal solution
matching algorithm
ranking algorithm
social network analysis
clustering method
graph search
minimum weight
semi supervised
subgraph mining