Sign in
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.
Weifan Wang
Danjun Huang
Yanwen Wang
Yiqiao Wang
Ding-Zhu Du
Published in:
J. Glob. Optim. (2016)
Keyphrases
</>
graph isomorphism
worst case
optimal solution
computational complexity
subgraph mining
undirected graph
planar graphs
dynamic programming
graph mining
subgraph isomorphism
social networks
clustering method
matching algorithm
approximation algorithms
graph structure
graph search