|
General Graph Refinement with Polynomial Delay
Jan Ramon and Siegfried Nijssen
In: Mining and Learning with Graphs, MLG 2007, 1-3 Aug 2007, Florence.
AbstractIn this article we introduce an algorithm for listing graphs without isomorphisms with polynomial delay. Such algorithms are commonly used in graph mining algorithms, but no algorithm until now managed to do this with polynomial delay. | EPrint Type: | Conference or Workshop Item (Paper) |
|---|
| Project Keyword: | Project Keyword UNSPECIFIED |
|---|
| Subjects: | Theory & Algorithms |
|---|
| ID Code: | 3617 |
|---|
| Deposited By: | Siegfried Nijssen |
|---|
| Deposited On: | 13 February 2008 |
|---|
[Edit]
|
