Download Node.java (graph mapping distance matrix generator)

You Might Also Like

Employee monitoring software with screenshots

Clear visibility and insights into how employees work. Even remotely.

Stay productive working at any distance from anywhere with Monitask.

Achieve perfect load balancing with a flexible Open Source Load Balancer

Take advantage of Open Source Load Balancer to elevate your business security and IT infrastructure with a custom ADC Solution.

Boost application security and continuity with SKUDONET ADC, our Open Source Load Balancer, that maximizes IT infrastructure flexibility. Additionally, save up to $470 K per incident with AI and SKUDONET solutions, further enhancing your organization’s risk management and cost-efficiency strategies.

Learn More

AI-based, Comprehensive Service Management for Businesses and IT Providers

Modular solutions for change management, asset management and more

ChangeGear provides IT staff with the functions required to manage everything from ticketing to incident, change and asset management and more. ChangeGear includes a virtual agent, self-service portals and AI-based features to support analyst and end user productivity.

Learn More

Small Business HR Management Software

Get a unified timekeeping, scheduling, payroll, HR and benefits portal with WorkforceHub.

WorkforceHub is the instantly useful, delightfully simple to use, small business solution for tracking time, scheduling and hiring. It scales as your business grows while delivering the mission-critical features an organization needs. It is tailored to, built for, and priced for small business employers.

Learn More

Engage for Amazon Connect, the Pre-built Contact Center Platform

Utilizing the power of AWS and Generative AI, Engage provides your customers with highly personalized, exceptional experiences.

Engage is a pre-built, intelligent contact center platform that transforms customer service.

Learn More

graph mapping distance matrix generator Overview

parallel REAFUM code

We propose a parallel algorithm to do representative approximate frequent subgraph mining based on the REAFUM algorithm in this project. We successfully apply Fork-Join Model to our algorithm and parallelize the calculations on the generation of graph mapping distance matrix. Our algorithm guarantees identical results with REAFUM given same input while achieving significant improvements in runtime when running with multi-threads. We also demonstrate the scalability of our algorithm by experimenting the runtime of our algorithm with various large number of graph databases as inputs. We also provide advise on how to set up our algorithm in order to apply it to different size of datasets as well as some potential directions to improve our algorithm in the future.
Here we only distribute the parallel part of the code, which is the generation of graph mapping distance matrix.

Additional Details for graph mapping distance matrix generator

Registered

2014-12-04

Last Updated

2016-11-22

Maintainers

xxpruc

Keep Me Updated!

Get notifications on updates for this project. Get newsletters and notices that include site news, special offers and exclusive discounts about IT products & services.

I understand by clicking on "Subscribe" below I am agreeing to the SourceForge Terms of Use and the Privacy Policy which describe how we use and share your data. I agree to receive these communications from SourceForge.net. I understand that I can withdraw my consent at anytime.

JavaScript is required for this form.