47 search results - page 8 / 10 » Mapping planar graphs into the Coxeter graph |
128
click to vote
CVPR
2010
IEEE
15 years 9 months 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...
103
Voted
COMBINATORICS
2000
15 years 28 days ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
130
click to vote
CCCG
2009
15 years 2 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
113
Voted
DCG
2007
15 years 1 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
129
Voted
COMGEO
2012
ACM
13 years 8 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...