Login / Signup

A fast algorithm for minimum weight odd circuits and cuts in planar graphs.

Adam N. LetchfordNicholas A. Pearson
Published in: Oper. Res. Lett. (2005)
Keyphrases
  • planar graphs
  • minimum weight
  • bipartite graph
  • spanning tree
  • weighted graph
  • greedy heuristic
  • tree patterns
  • minimum spanning tree
  • lower bound
  • undirected graph
  • edge weights