Login / Signup

A strengthening of the Kuratowski planarity criterion for 3-connected graphs.

Alexander K. Kelmans
Published in: Discret. Math. (1984)
Keyphrases
  • connected graphs
  • line drawings
  • preprocessing
  • minimum description length
  • data sets
  • databases
  • machine learning
  • learning algorithm
  • multiscale
  • multiresolution
  • markov random field
  • closed form