The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Graph pattern matching: from intractable to polynomial time
Abstract
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose a class of graph patterns, in which an edge denotes the connectivity in a data graph within a predefined number of hops. In addition, we define matching based on a notion of bounded simulation, an extension of graph simulation. We show that with this revision, graph pattern matching can be performed in cubic-time, by providing such an algorithm. We also develop algorithms for incrementally finding matches when data graphs are updated, with performance guarantees for dag patterns. We experimentally verify that these algorithms scale well, and that the revised notion of graph pattern matching allows us to identify communities commonly found in real-world networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
Bang-Jensen, J., & Gutin, G. (2002) · doi:10.1007/978-1-4471-3886-0 · Cited by 1,856
Reachability and Distance Queries via 2-Hop Labels
Cohen, E., Halperin, E., Kaplan, H., & Zwick, U. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403098 · Cited by 518
Graphs-at-a-time: query language and access methods for graph databases
He, H., & Singh, A. K. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376660 · Cited by 450
Algorithmics and applications of tree and graph searching
Shasha, D., Wang, J. T. L., & Giugno, R. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543620 · Cited by 387
Social matching: A framework and research agenda
Terveen, L., & McDonald, D. W. (2005) · ACM Transactions on Computer-Human Interaction · doi:10.1145/1096737.1096740 · Cited by 315
A framework for analysis of dynamic social networks
Berger-Wolf, T. Y., & Saia, J. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150462 · Cited by 253
Fast best-effort pattern matching in large attributed graphs
Tong, H., Faloutsos, C., Gallagher, B. J., & Eliassi‐Rad, T. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281271 · Cited by 251
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Wang, H., He, H., Yang, J., Yu, P. S., & Yu, J. X. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.53 · Cited by 242
Distance-join: pattern match query in a large graph database
Zou, L., Chen, L., & Özsu, M. T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687727 · Cited by 200
Cited by
A survey of community search over big graphs
Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00556-x · Cited by 339
Metadata
- Authors
- Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., & Wu, Y.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2010-09
- Volume
- 3
- Issue
- 1-2
- Pages
- 264-275
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2123966888
- Cited by
- 285
- References
- 16
- FWCI
- 19.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graph pattern matching: from intractable to polynomial time. https://app.cochat.ai/papers/10.14778/1920841.1920878
- The paper
- Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., & Wu, Y. (2010). Graph pattern matching: from intractable to polynomial time. Proceedings of the VLDB Endowment. https://doi.org/10.14778/1920841.1920878
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
