Sciweavers

1664 search results - page 145 / 333
» Distance labeling in graphs
Sort
View
JGT
2010
103views more  JGT 2010»
15 years 3 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
ISAAC
2003
Springer
96views Algorithms» more  ISAAC 2003»
15 years 9 months ago
On the Geometric Dilation of Finite Point Sets
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...
RSA
2006
81views more  RSA 2006»
15 years 4 months ago
On random points in the unit disk
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
Robert B. Ellis, Xingde Jia, Catherine H. Yan
AVSS
2009
IEEE
15 years 2 months ago
Landmark Localisation in 3D Face Data
A comparison of several approaches that use graph matching and cascade filtering for landmark localisation in 3D face data is presented. For the first method, we apply the structur...
Marcelo Romero, Nick Pears
IWCIA
2004
Springer
15 years 10 months ago
Integral Trees: Subtree Depth and Diameter
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo