The complexity of mining maximal frequent subgraphs | Swiss German University Library

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}

No image available for this title

Paper

The complexity of mining maximal frequent subgraphs

Kimelfeld, Benny - Personal Name; Kolaitis, Phokion G. - Personal Name;

Description Not Available

Availability

No copy data

Detail Information

Series Title: -
Call Number: -
Publisher: mou : ACM Transactions on Database Systems., 2014
Collation: -
Language: English
ISBN/ISSN: 0362-5915
Classification: NONE
Content Type: -
Media Type: -
Carrier Type: -
Edition: -
Subject(s): Graph mining
Maximal frequent subgraphs
Specific Detail Info: -
Statement of Responsibility: -

Other version/related

No other version available

File Attachment

No Data

Comments

You must be logged in to post a comment