| Question asked
|
This question is for two presentations, an … This question is for two presentations, and maybe it can be discussed once ''both'' presentations have been given. The two papers both look at ways of summarizing a graph structure in order to quicken certain types of queries. I wonder if the presenters, or anyone else, has any thoughts about whether the techniques described in each of these papers might be applied to the problems described in the other, or whether some hybrid approach might be useful for some tasks. d approach might be useful for some tasks.
|
