Sciweavers

34 search results - page 2 / 7
» Minimum dilation stars
Sort
View
CORR
2008
Springer
66views Education» more  CORR 2008»
13 years 5 months ago
On stars and Steiner stars. II
A Steiner star for a set P of n points in Rd connects an arbitrary center point to all points of P, while a star connects a point p P to the remaining n-1 points of P. All connec...
Adrian Dumitrescu, Csaba D. Tóth, Guangwu X...
ISAAC
2005
Springer
135views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Embedding Point Sets into Plane Graphs of Small Dilation
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
Annette Ebbers-Baumann, Ansgar Grüne, Marek K...
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 7 months ago
On stars and Steiner stars
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....
Adrian Dumitrescu, Csaba D. Tóth
CORR
2004
Springer
92views Education» more  CORR 2004»
13 years 5 months ago
Embeddings into the Pancake Interconnection Network
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In ...
Christian Lavault
DM
2002
116views more  DM 2002»
13 years 5 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...