The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A Rete Network Construction Algorithm for Incremental Pattern Matching
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Rete: A fast algorithm for the many pattern/many object pattern match problem
Forgy, C. L. (1982) · Artificial Intelligence · doi:10.1016/0004-3702(82)90020-0 · Cited by 2,634
Algorithm 457: finding all cliques of an undirected graph
Bron, C., & Kerbosch, J. (1973) · Communications of the ACM · doi:10.1145/362342.362367 · Cited by 2,452
Jouault, F., & Kurtev, I. (2006) · Lecture notes in computer science · doi:10.1007/11663430_14 · Cited by 939
Jouault, F., & Kurtev, I. (2006) · HAL · Cited by 467
Ehrig, H., Nagl, M., Rozenberg, G., & Rosenfeld, A. (1988) · Medical Entomology and Zoology · Cited by 391
Pleuss, A., Sauer, S., Hussmann, H., & den Bergh, J. V. (2006) · Lecture notes in computer science · doi:10.1007/11663430 · Cited by 249
A Simple Game-Theoretic Approach to Checkonly QVT Relations
Stevens, P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02408-5_12 · Cited by 248
Biological network motif detection: principles and practice
Wong, E., Baur, B., Quader, S., & Huang, C.-H. (2012) · Briefings in Bioinformatics · doi:10.1093/bib/bbr033 · Cited by 178
Incremental Evaluation of Model Queries over EMF Models
Bergmann, G., Horváth, Á., Ráth, I., Varró, D., Balogh, A., Balogh, Z., & Ökrös, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16145-2_6 · Cited by 119
Incremental pattern matching in the viatra model transformation system
Bergmann, G., Ökrös, A., Ráth, I., Varró, D., & Varró, G. (2008) · doi:10.1145/1402947.1402953 · Cited by 79
Self-citation
Cited by
IncQuery-D: A Distributed Incremental Model Query Framework in the Cloud
Szárnyas, G., Izsó, B., Ráth, I., Harmath, D., Bergmann, G., & Varró, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11653-2_40 · Cited by 55
Variability-based model transformation: formal foundation and application
Strüber, D., Rubin, J., Arendt, T., Chećhik, M., Taentzer, G., & Plöger, J. (2017) · Formal Aspects of Computing · doi:10.1007/s00165-017-0441-3 · Cited by 37
RuleMerger: Automatic Construction of Variability-Based Model Transformation Rules
Strüber, D., Rubin, J., Arendt, T., Chećhik, M., Taentzer, G., & Plöger, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49665-7_8 · Cited by 34
Modularizing Triple Graph Grammars Using Rule Refinement
Anjorin, A., Saller, K., Lochau, M., & Schürr, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54804-8_24 · Cited by 29
Inter-model Consistency Checking Using Triple Graph Grammars and Linear Optimization Techniques
Leblebici, E., Anjorin, A., & Schürr, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-54494-5_11 · Cited by 27
Metadata
- Authors
- Varró, G., & Deckwerth, F.
- Affiliations
- Technische Universität Darmstadt (DE)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 125-140
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1751328170
- Cited by
- 26
- References
- 20
- Citations by year
- 2025: 1 · 2024: 2 · 2022: 2 · 2021: 2 · 2020: 4 · 2019: 3 · 2018: 1 · 2017: 5 · 2016: 3 · 2014: 3
- FWCI
- 1.28
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- TUbilio (Technical University of Darmstadt) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Computer Science › Software › Model-Driven Software Engineering Techniques
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Keywords
- Rete algorithm, dynamic programming, network topology optimization, cost function, motif recognition, runtime performance
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: A Rete Network Construction Algorithm for Incremental Pattern Matching. https://app.cochat.ai/papers/10.1007/978-3-642-38883-5_13
- The paper
- Varró, G., & Deckwerth, F. (2013). A Rete Network Construction Algorithm for Incremental Pattern Matching. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-38883-5_13
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.