Mining preserving structures in a graph sequence
From MaRDI portal
Publication:344786
DOI10.1016/j.tcs.2015.12.007zbMath1353.68218OpenAlexW1573982677MaRDI QIDQ344786
Publication date: 24 November 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.007
enumerationdata miningtrajectory mininggraph sequencepolynomial delaypreserving structurestructure mining
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Finding all the perfect matchings in bipartite graphs
- Complete mining of frequent patterns from graphs: Mining graph data
- Finding all maximal cliques in dynamic graphs
- Reverse search for enumeration
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Sparsification—a technique for speeding up dynamic graph algorithms
- Algorithm Theory - SWAT 2004
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Dynamic Graph Clustering Using Minimum-Cut Trees