On the public citation graph

Approximate Constrained Subgraph Matching

https://doi.org/10.1007/11564751_74
0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11564751openalex-snapshot
Principles and Practice of Constraint Programming - CP 2005
inferredcites →https://doi.org/10.1007/11564751_18openalex-snapshot
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
inferredcites →https://doi.org/10.1007/978-3-540-24664-0_20openalex-snapshot
A Global Constraint for Graph Isomorphism Problems
inferredcites →https://doi.org/10.1007/978-3-540-46464-8_17openalex-snapshot
Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching
inferredcites →https://doi.org/10.1007/b75045openalex-snapshot
Theory and Application of Graph Transformations
inferredcites →https://doi.org/10.1017/s0960129501003577openalex-snapshot
Constraint satisfaction algorithms for graph pattern matching
inferredcites →https://doi.org/10.1109/iciap.1999.797762openalex-snapshot
Performance evaluation of the VF graph matching algorithm
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
inferredcites →https://doi.org/10.48550/arxiv.cs/0105015openalex-snapshot
The alldifferent Constraint: A Survey

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470612309.ch10openalex-snapshot
Symmetry Breaking in Subgraph Pattern Matching
inferred← citeshttps://doi.org/10.1007/11564751_18openalex-snapshot
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-1-59745-531-2_25openalex-snapshot
Representing and Analyzing Biochemical Networks Using BioMaze
inferred← citeshttps://doi.org/10.1007/978-3-030-39197-3_2openalex-snapshot
Flexible Graph Matching and Graph Edit Distance Using Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-032-14107-1_16openalex-snapshot
Enumeration of Subgraph of Interest Based on Pruning
inferred← citeshttps://doi.org/10.1007/978-3-540-68020-8_6openalex-snapshot
A Generic Graph Distance Measure Based on Multivalent Matchings
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_51openalex-snapshot
Filtering for Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_6openalex-snapshot
Combining Two Structured Domains for Modeling Various Graph Matching Problems
inferred← citeshttps://doi.org/10.1007/s10601-009-9074-3openalex-snapshot
Solving subgraph isomorphism problems with constraint programming
inferred← citeshttps://doi.org/10.1007/s11036-019-01363-yopenalex-snapshot
The Application Study of Subgraph Isomorphism in the SDMA
inferred← citeshttps://doi.org/10.1109/fpl.2006.311300openalex-snapshot
Semi Synthetic Circuit Generation Using Graph Monomorphism for Testing Incremental Placement and Incremental Routing Tools
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3583792openalex-snapshot
InstPro: Provenance-Based Transient Execution Attack Detection and Investigation on Instruction Execution Traces
inferred← citeshttps://doi.org/10.1145/3579654.3579768openalex-snapshot
An Efficient Alternative to Subgraph Isomorphism and Its Advantages
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11137openalex-snapshot
Between Subgraph Isomorphism and Maximum Common Subgraph
inferred← citeshttps://doi.org/10.22028/d291-26940openalex-snapshot
Alignment of multi-cultural knowledge repositories
inferred← citeshttps://doi.org/10.48550/arxiv.0805.1030openalex-snapshot
Decomposition Techniques for Subgraph Matching
inferred← citeshttps://doi.org/10.70675/3ae14a76zf809z454dz82a9z9414f1c69cf3openalex-snapshot
Appariement de graphes & [et] optimisation dynamique par colonies de fourmis
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.