335 search results - page 52 / 67 » How to Use Spanning Trees to Navigate in Graphs |
166
click to vote
WEBDB
2005
Springer
15 years 11 months ago
2005
Springer
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
167
click to vote
SLS
2009
Springer
16 years 16 days ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
129
click to vote
IPL
2008
15 years 6 months ago
2008
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
179
click to vote
TON
2002
15 years 5 months ago
2002
Packet delay greatly influences the overall performance of network applications. It is therefore important to identify causes and location of delay performance degradation within ...
150
click to vote
FSTTCS
2009
Springer
16 years 17 days ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...