Login / Signup
Connectivity check in 3-connected planar graphs with obstacles.
Bruno Courcelle
Cyril Gavoille
Mamadou Moustapha Kanté
Andrew Twigg
Published in:
Electron. Notes Discret. Math. (2008)
Keyphrases
</>
planar graphs
connected components
binary images
undirected graph
approximate inference
image segmentation
markov random field
probabilistic inference