todo314 @ ウィキ

タグ「SIGMOD」を含むページ一覧

• Efficiently Computing k-Edge Connected Components via Graph Decomposition
• Massive Graph Triangulation
• I/O Efficient: Computing SCCs in Massive Graphs
• TurboISO: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large ...
• TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in ...
• Online Search of Overlapping Communities
• In Search of Influential Event Organizers in Online Social Networks
• Efficient Location-Aware Influence Maximization
• On k-skip Shortest Paths
• Querying K-Truss Community in Large and Dynamic Graph
• COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks
• The Pursuit of a Good Possible World: Extracting Representative Instances of ...
• Spheres of Influence for More Effective Viral Marketing
• Speedup Graph Processing by Graph Ordering
• Distributed Set Reachability
• Local Graph Sparsification for Scalable Clustering
• Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study
• Efficient Ad-hoc Search for Personalized PageRank
• Scaling Locally Linear Embedding
• Dynamic Density Based Clustering
• DAG Reduction: Fast Answering Reachability Queries
• Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms
• Holistic Influence Maximization: Combining Scalability and Efficiency with ...
• Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency
• Influence Maximization in Near-Linear Time: A Martingale Approach
• Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in ...