263 search results - page 27 / 53 » Path partitions of hypercubes |
JAL
2002
15 years 1 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
102
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
114
click to vote
SIGMOD
2004
ACM
15 years 7 months ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
122
click to vote
FUN
2007
Springer
15 years 5 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
118
click to vote
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...