Sciweavers

525 search results - page 68 / 105
» Bidimensionality and geometric graphs
Sort
View
CAGD
2006
73views more  CAGD 2006»
13 years 9 months ago
Rational surfaces with linear normals and their convolutions with rational surfaces
It is shown that polynomial (or rational) parametric surfaces with a linear field of normal vectors are dual to graphs bivariate polynomials (or rational functions). We discuss th...
Maria Lucia Sampoli, Martin Peternell, Bert Jü...
JCT
2006
69views more  JCT 2006»
13 years 8 months ago
The Bergman complex of a matroid and phylogenetic trees
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
Federico Ardila, Caroline J. Klivans
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
14 years 29 days ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
PR
2007
141views more  PR 2007»
13 years 8 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock
INFOCOM
2009
IEEE
14 years 3 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...