Name
Abstract | ||
|---|---|---|
Given a series G={G"0,G"1,...,G"T} of graphs encompassing V vertices and E edges, a periodic graph is a spatially as well as temporally maximal subgraph of a subsequence of G in the form G"i^p={G"i,G"i"+"p,...,G"i"+"n"p}, where n is not smaller than some predetermined threshold value @s. An algorithm for finding all such subgraphs is proposed taking time O((E+V)T^2ln(T/@s)), which is faster by a factor of T than the method previously available. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ipl.2011.02.016 | Inf. Process. Lett. |
Keywords | Field | DocType |
temporally maximal subgraph,v vertex,threshold value,periodic subgraph miner,form g,time o,series g,e edge,periodic graph,analysis of algorithms | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Analysis of algorithms,Subsequence,Periodic graph (geometry),Mathematics,Speedup | Journal |
Volume | Issue | ISSN |
111 | 11 | 0020-0190 |
Citations | PageRank | References |
4 | 0.51 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Apostolico | 1 | 1441 | 182.20 |
| Manuel Barbares | 2 | 4 | 0.51 |
| Cinzia Pizzi | 3 | 139 | 15.73 |