Mining preserving structures in a graph sequence
DOI10.1016/J.TCS.2015.12.007zbMATH Open1353.68218OpenAlexW1573982677MaRDI QIDQ344786FDOQ344786
Authors: Takeaki Uno, Yushi Uno 
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
Recommendations
data miningenumerationtrajectory mininggraph sequencepolynomial delaypreserving structurestructure mining
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Finding all the perfect matchings in bipartite graphs
- Reverse search for enumeration
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Sparsification—a technique for speeding up dynamic graph algorithms
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Complete mining of frequent patterns from graphs: Mining graph data
- Finding all maximal cliques in dynamic graphs
- Algorithm Theory - SWAT 2004
- Title not available (Why is that?)
- Dynamic Graph Clustering Using Minimum-Cut Trees
Cited In (7)
- Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
- Mining constrained cross-graph cliques in dynamic networks
- Mining preserving structures in a graph sequence
- Speedup for a periodic subgraph miner
- Mining evolving patterns of connection subgraphs over evolving graphs
- Efficient algorithms for the periodic subgraphs mining problem
- Learning block-preserving graph patterns and its application to data mining
Uses Software
This page was built for publication: Mining preserving structures in a graph sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344786)
