z-logo
open-access-imgOpen Access
A STUDY ON GRAPH MINING ALGORITHMS TO DISCOVER FREQUENT SUBGRAPH PATTERNS FROM EXACT GRAPH DATA AND UNCERTAIN GRAPH DATABASE
Author(s) -
Saroj Shambharkar,
Dinesh Reddy,
Mohammed Rihaz,
Wein Haun,
Deepak Wang,
Jack Bangyopadhyay,
Jan Snoeyink,
Alexander Prins
Publication year - 2018
Publication title -
international journal of latest trends in engineering and technology
Language(s) - English
Resource type - Journals
eISSN - 2319-3778
pISSN - 2278-621X
DOI - 10.21172/1.93.41
Subject(s) - graph database , distance hereditary graph , computer science , graph , factor critical graph , subgraph isomorphism problem , induced subgraph isomorphism problem , graph factorization , line graph , data mining , theoretical computer science , voltage graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom