17 search results - page 1 / 4 » Planar Graphs, via Well-Orderly Maps and Trees |
WG
2004
Springer
13 years 9 months ago
2004
Springer
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
CVPR
2010
IEEE
14 years 26 days ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
COMBINATORICS
2004
13 years 4 months ago
2004
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...