3220 search results - page 353 / 644 » Constrained Graph Processes |
191
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
196
click to vote
CIE
2007
Springer
16 years 23 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
140
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
223
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
153
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...