Probabilistic Subgraph Matching on Huge Social Networks - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Matthias Bröcheler, Andrea Pugliese, V. S. Subrahmanian. Probabilistic Subgraph Matching on Huge Social Networks. In International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011, Kaohsiung, Taiwan, 25-27 July 2011. pages 271-278, IEEE Computer Society, 2011. [doi]

The following publications are possibly variants of this publication:

SMAC: Subgraph Matching and Centrality in Huge Social NetworksNoseong Park, Michael Ovelgönne, V. S. Subrahmanian. socialcom 2013: 134-141 [doi]

A budget-based algorithm for efficient subgraph matching on Huge NetworksMatthias Bröcheler, Andrea Pugliese, V. S. Subrahmanian. icde 2011: 94-99 [doi]

COSI: Cloud Oriented Subgraph Identification in Massive Social NetworksMatthias Bröcheler, Andrea Pugliese, V. S. Subrahmanian. asunam 2010: 248-255 [doi]

runs on WebDSL