FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs

DOI10.7155/JGAA.00247zbMath1276.05121OpenAlexW1973815317MaRDI QIDQ2865059

P. Nirmala, M. Thilaga, R. Vijayalakshmi, R. Nadarajan, John F. Roddick

Publication date: 28 November 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00247

zbMATH Keywords

frequent pattern mininggraph databasegraph miningmaximum common subgraphfrequent subgraphmaximal frequent subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Performance evaluation of frequent subgraph discovery techniques ⋮ Cost and accuracy aware scientific workflow retrieval based on distance measure

Uses Software

• gSpan
• ANF

This page was built for publication: FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs