335 search results - page 47 / 67 » How to Use Spanning Trees to Navigate in Graphs |
158
click to vote
IJCNN
2007
IEEE
16 years 13 days ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
164
click to vote
GLOBECOM
2008
IEEE
16 years 18 days ago
2008
IEEE
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....
145
click to vote
ICNP
1998
IEEE
15 years 10 months ago
1998
IEEE
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...
143
click to vote
DOCENG
2009
ACM
16 years 20 days ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
153
click to vote
STACS
2007
Springer
16 years 8 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...