Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.
Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
Try it Free
Go From AI Idea to AI App Fast
One platform to build, fine-tune, and deploy ML models. No MLOps team required.
Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed
an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach
(http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM)
algorithm that is capable of detecting approximate subgraph matching based on a subgraph
distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges
respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m).
...
Exact Subgraph Matching Algorithm for Dependency Graphs
...This Java implementation implements our ESM algorithm. See README file: https://sourceforge.net/projects/esmalgorithm/files/
If you use our ESM implementation to support academic research, please cite the following paper:
Haibin Liu, Vlado Keselj, and Christian Blouin. Exploring a Subgraph Matching Approach for Extracting Biological Events from Literature. Computational Intelligence, 2013.