C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Spanning closed walks and TSP in 3-connected planar graphs.
Ken-ichi Kawarabayashi
Kenta Ozeki
Published in:
J. Comb. Theory, Ser. B (2014)
Keyphrases
</>
planar graphs
traveling salesman problem
search space
connected components
optimal solution
ant colony optimization
minimum weight
approximate inference
weighted graph
probabilistic model
image segmentation
level set
optimization problems
greedy algorithm
np hard
partition function
lower bound
objective function