VF2++ -- an improved subgraph isomorphism algorithm
type: Item
instance of: scholarly article
title: VF2++ -- an improved subgraph isomorphism algorithm
zbMATH Open document ID: 1384.05146
author: Alpár Jüttner
author: Péter Madarasi
published in: Discrete Applied Mathematics
publication date: 2018-04-20T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 6862771
zbMATH Keywords: computational biology
zbMATH Keywords: subgraph isomorphism problem
describes a project that uses: LEMON
MaRDI profile type: Publication
full work available at URL: j.dam.2018.02.018
OpenAlex ID: W2795196889
cites work: Colored hypergraph isomorphism is fixed parameter tractable
cites work: On testing isomorphism of permutation graphs
cites work: The complexity of theorem-proving procedures
cites work: Q4148000
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Q3671211
cites work: AllDifferent-based filtering for subgraph isomorphism
cites work: An Algorithm for Subgraph Isomorphism
cites work: Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Wikidata QID: Q130048644
DOI: 10.1016/J.DAM.2018.02.018
description: scientific article; zbMATH DE number 6862771