Search Results for "esm"

shadow-cljs is a ClojureScript build tool designed with simplicity and modern JavaScript interoperability in mind. Distributed via npm, it handles compilation, hot-reloading, module targets (ESM, Node, Browser), and tight integration with JS tooling. Creating your project can be done quickly using the npx create-cljs-project utility. npx is part of npm and lets us run utility scripts quickly without worrying about installing them first. The installer will create a basic project scaffold and install the latest version of shadow-cljs in the project. ...

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). ...

...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.