Distance constrained labelings of planar graphs with no short cycles.

Zdenek Dvorák Daniel Král Pavel Nejedlý Riste Skrekovski

Published in: Discret. Appl. Math. (2009)

Keyphrases

planar graphs
distance function
dynamic programming
probabilistic model
distance measure
maximum likelihood
approximate inference
minimum weight