Login / Signup

Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs.

Charles J. ColbournKellogg S. Booth
Published in: SIAM J. Comput. (1981)
Keyphrases
  • planar graphs
  • max cut
  • worst case
  • graph theory
  • computational complexity
  • optimization problems
  • pairwise
  • special case
  • upper bound
  • graphical models
  • problems in computer vision