Work

MESM: A Query-Agnostic and Memory-Efficient Parallel Subgraph Matching Algorithm

Year: 2024

Type: conference-paper

Source: IEEE High Performance Extreme Computing Conference

DOI: 10.1109/hpec62836.2024.10938524

Authors: Shubhashish Kar, Shaikh Arifuzzaman

Institution: University of Nevada, Las Vegas

Language: English

Topic: Graph Theory and Algorithms

Subfield: Computer Vision and Pattern Recognition

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funder: National Science Foundation

Award: RII Track-4:NSF: DyG-MAP: Fast Algorithms for Mining and Analysis of Evolving Patterns in Large Dynamic Graphs

OpenAlex ID: W4409132223

FWCI: 0.229

Cites: 29

Cited by: 1

Related to: 10