Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength
Graph decomposition methods using k-core and k-truss hierarchically group vertices and edges from external to internal by degrees of vertices or tie strength of edges. As both the user engagement of nodes and ...
-
Chapter and Conference Paper
Maintaining Boolean Top-K Spatial Temporal Results in Publish-Subscribe Systems
Nowadays many devices and applications in social networks and location-based services are producing, storing and using description, location and occurrence time of objects. Given a massive number of boolean to...