11381 search results - page 354 / 2277 » Connectivity |
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
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...
207
click to vote
DATAMINE
2010
15 years 6 months ago
2010
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
158
click to vote
DCG
2008
15 years 6 months ago
2008
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows addition...
141
Voted
DM
2008
15 years 6 months ago
2008
We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian), by Thomassen (every 4-connected line graph is hamiltonian) and by Fleischne...
156
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...