Fast Parallel All-Subgraph Enumeration Using Multicore Machines release_xy4vdw24k5g2hhl223xcrl4ddq

by Saeed Shahrivari, Saeed Jalili

Published in Scientific Programming by Hindawi Limited.

2015   Volume 2015, p1-11

Abstract

Enumerating all subgraphs of an input graph is an important task for analyzing complex networks. Valuable information can be extracted about the characteristics of the input graph using all-subgraph enumeration. Notwithstanding, the number of subgraphs grows exponentially with growth of the input graph or by increasing the size of the subgraphs to be enumerated. Hence, all-subgraph enumeration is very time consuming when the size of the subgraphs or the input graph is big. We propose a parallel solution named<jats:italic>Subenum</jats:italic>which in contrast to available solutions can perform much faster. Subenum enumerates subgraphs using edges instead of vertices, and this approach leads to a parallel and load-balanced enumeration algorithm that can have efficient execution on current multicore and multiprocessor machines. Also, Subenum uses a fast heuristic which can effectively accelerate non-isomorphism subgraph enumeration. Subenum can efficiently use external memory, and unlike other subgraph enumeration methods, it is not associated with the main memory limits of the used machine. Hence, Subenum can handle large input graphs and subgraph sizes that other solutions cannot handle. Several experiments are done using real-world input graphs. Compared to the available solutions, Subenum can enumerate subgraphs several orders of magnitude faster and the experimental results show that the performance of Subenum scales almost linearly by using additional processor cores.
In application/xml+jats format

Archived Files and Locations

application/pdf  1.8 MB
file_qnyyxyhlubbmjlhir7mz3sqssa
downloads.hindawi.com (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Year   2015
Language   en ?
Container Metadata
Open Access Publication
In DOAJ
In Keepers Registry
ISSN-L:  1058-9244
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 04824175-716c-4fa1-8b03-4466e9022fb5
API URL: JSON