2365 search results - page 75 / 473 » All things are connected |
120
click to vote
AAIM
2005
Springer
15 years 7 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
103
click to vote
GD
2004
Springer
15 years 6 months ago
2004
Springer
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
102
click to vote
3DPVT
2002
IEEE
15 years 6 months ago
2002
IEEE
Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to ...
108
click to vote
DISOPT
2008
15 years 1 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
100
click to vote
CONNECTION
2006
15 years 1 months ago
2006
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...