2015•Knowledge-Based SystemsRequires access

Approximating the maximum common subgraph isomorphism problem with a weighted graph

Alan Chia-Lung Chen, Ahmed Elhajj, Shang Gao, Abdullah Sarhan, Salim Afra, Ahmad Kassem, Reda Alhajj

Open publisher page 10 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Induced subgraph isomorphism problem, Subgraph isomorphism problem, Graph isomorphism, Mathematics, Combinatorics, Graph homomorphism, Distance-hereditary graph, Isomorphism (crystallography)

Back to paper search Browse research topics Original source

Approximating the maximum common subgraph isomorphism problem with a weighted graph — Research Paper | ScholarLens