Login / Signup

On longest cycles in essentially 4-connected planar graphs.

Igor FabriciJochen HarantStanislav Jendrol'
Published in: Discuss. Math. Graph Theory (2016)
Keyphrases
  • planar graphs
  • connected components
  • minimum weight
  • undirected graph
  • image segmentation
  • conditional random fields
  • bipartite graph
  • approximate inference