39 search results - page 5 / 8 » Adjacency posets of planar graphs |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
GD
2008
Springer
13 years 8 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
ICNP
2005
IEEE
14 years 19 days ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
SIAMDM
2008
13 years 7 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...