Sciweavers

1633 search results - page 208 / 327
» Planar Map Graphs
Sort
View
GC
2007
Springer
13 years 10 months ago
An Ore-type analogue of the Sauer-Spencer Theorem
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
Alexandr V. Kostochka, Gexin Yu
DGCI
2008
Springer
14 years 5 days ago
On Watershed Cuts and Thinnings
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
GIS
2009
ACM
14 years 2 months ago
A new perspective on efficient and dependable vehicle routing
The essential elements of any navigation system are a shortest-path algorithm and accurate map data. The contribution of this work is two-fold. First, the HBA algorithm, an effici...
Dieter Pfoser, Alexandros Efentakis, Agnès ...
GD
2009
Springer
14 years 1 months ago
More Flexible Radial Layout
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...
Ulrik Brandes, Christian Pich
EJC
2010
13 years 10 months ago
Dualities in full homomorphisms
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr