Fast Streaming Small Graph Canonization

• Type: Article in International Conference Proceedings Book
• Date: 2018

Authors

Paredes, P (Author) Other; Pedro Ribeiro (Author) FCUP

Conference proceedings International

Title: COMPLEX NETWORKS IX

Pages: 27-40

9th International Conference on Complex Networks (CompleNet)

Northeastern Univ, Boston, MA, MAR 05-08, 2018

Indexing

ISI Web of Knowledge - 0 Citations

Scopus - 0 Citations

Other information

Authenticus ID: P-00P-RJM

DOI: 10.1007/978-3-319-73198-8_3

Abstract (EN): In this paper, we introduce the streaming graph canonization problem. Its goal is finding a canonical representation of a sequence of graphs in a stream. Our model of a stream fixes the graph's vertices and allows for fully dynamic edge changes, meaning it permits both addition and removal of edges. Our focus is on small graphs, since small graph isomorphism is an important primitive of many subgraph-based metrics, like motif analysis or frequent subgraph mining. We present an efficient data structure to approach this problem, namely a graph isomorphism discrete finite automaton and showcase its efficiency when compared to a non-streaming-aware method that simply recomputes the isomorphism information from scratch in each iteration.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 14