Login / Signup

An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.

Takao AsanoShunji KikuchiNobuji Saito
Published in: Graph Theory and Algorithms (1980)
Keyphrases
  • planar graphs
  • np hard
  • dynamic programming
  • probabilistic model
  • linear programming
  • expectation maximization
  • tree structure
  • monte carlo
  • optimal solution
  • lower bound
  • training set
  • knapsack problem
  • graph structure