2137 search results - page 307 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
165
click to vote
PDPTA
2000
15 years 6 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
136
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
214
Voted
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
135
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
163
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...