1986 search results - page 243 / 398 » Path Separability of Graphs |
123
Voted
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
121
click to vote
ICST
2009
IEEE
15 years 10 months ago
2009
IEEE
We propose a novel testing approach that combines information from UML sequence models and state machine models. Current approaches that rely solely on sequence models do not cons...
122
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
138
Voted
HPCC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
128
click to vote
PODC
2004
ACM
15 years 9 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...