Φορτώνει......
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
|
| Θέματα: | |
| Διαθέσιμο Online: | https://www.redalyc.org/articulo.oa?id=61520938010 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
Φορτώνει......