Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Performance evaluation of frequent subgraph discovery techniques

From MaRDI portal
Publication:1719279
Jump to:navigation, search

DOI10.1155/2014/869198zbMath1407.68371OpenAlexW2157617915WikidataQ59070269 ScholiaQ59070269MaRDI QIDQ1719279

Yan Zhuang, Sohail Asghar, Simon Fong, Saif Ur Rehman

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/869198



Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)



Uses Software

  • gSpan
  • CloseGraph


Cites Work

  • Data mining in bioinformatics
  • Managing and mining graph data
  • FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs




This page was built for publication: Performance evaluation of frequent subgraph discovery techniques

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1719279&oldid=14046570"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki