Sign in

Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings.

Radoslav Fulek
Published in: SIAM J. Discret. Math. (2014)
Keyphrases
  • small number
  • computational complexity
  • undirected graph
  • graphical models
  • binary images
  • edge detector
  • spanning tree
  • graph clustering