A new algorithm for induced subgraph isomorphism

MaRDI QIDQ4605125zbMATH OpenFDO

Authors Nadia M. G. Al-Saidi, Nuha A. Rajab, Hayder N. Abdul-Rahman

Publication date 6 March 2018

zbMATH Keywords

graph isomorphismincidence matrixinduced subgraphtime

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Recommendations

• An Algorithm Portfolio for the Sub-graph Isomorphism Problem
• scientific article; zbMATH DE number 2097443
• AllDifferent-based filtering for subgraph isomorphism
• Algorithms for subgraph isomorphism in graph pattern mining
• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications

Cited in

(11)

• VF2++ -- an improved subgraph isomorphism algorithm
• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications
• Algorithms for subgraph isomorphism in graph pattern mining
• An algorithm using length-r paths to approximate subgraph isomorphism
• scientific article; zbMATH DE number 1500686 (Why is no real title available?)
• scientific article; zbMATH DE number 2097443 (Why is no real title available?)
• scientific article; zbMATH DE number 2117153 (Why is no real title available?)
• A unified framework for strengthening topological node features and its application to subgraph isomorphism detection
• A Bound for Non-subgraph Isomorphism
• An Algorithm Portfolio for the Sub-graph Isomorphism Problem
• PathLAD+: Towards effective exact methods for subgraph isomorphism problem

This page was built for publication: A new algorithm for induced subgraph isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605125)