Sciweavers

63 search results - page 6 / 13
» Cubic Graphs Have Bounded Slope Parameter
Sort
View
WG
2001
Springer
14 years 2 days ago
(k, +)-Distance-Hereditary Graphs
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
Serafino Cicerone, Gianluca D'Ermiliis, Gabriele D...
SODA
2004
ACM
160views Algorithms» more  SODA 2004»
13 years 9 months ago
On colorings of squares of outerplanar graphs
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
Geir Agnarsson, Magnús M. Halldórsso...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 9 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
SMA
2009
ACM
208views Solid Modeling» more  SMA 2009»
14 years 2 months ago
On the parameterization of Catmull-Rom curves
The behavior of Catmull-Rom curves heavily depends on the choice of parameter values at the control points. We analyze a class of parameterizations ranging from uniform to chordal...
Cem Yuksel, Scott Schaefer, John Keyser
CAD
2011
Springer
12 years 11 months ago
Parameterization and applications of Catmull-Rom curves
The behavior of Catmull-Rom curves heavily depends on the choice of parameter values at the control points. We analyze a class of parameterizations ranging from uniform to chordal...
Cem Yuksel, Scott Schaefer, John Keyser