ロード中...
Reducing the Number of Canonical Form Tests for Frequent Subgraph Mining
Frequent connected subgraph (FCS) mining is an interesting problem with wide applications in real life. Most of the FCS mining algorithms have been focused on detecting duplicate candidates using canonical form tests. Canonical form tests have high computational complexity, and therefore, they affec...
保存先:
| 出版年: | Computación y Sistemas |
|---|---|
| 主要な著者: | , , , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Instituto Politécnico Nacional
2011
|
| 主題: | |
| オンライン･アクセス: | https://www.redalyc.org/articulo.oa?id=61520938010 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|