Mining preserving structures in a graph sequence

DOI10.1016/J.TCS.2015.12.007MaRDI QIDQ344786zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

data miningenumerationgraph sequencepolynomial delaypreserving structurestructure miningtrajectory mining

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Mining preserving structures in a graph sequence
• Efficient algorithms for the periodic subgraphs mining problem
• Mining evolving patterns of connection subgraphs over evolving graphs
• Speedup for a periodic subgraph miner
• Mining constrained cross-graph cliques in dynamic networks

Cites work

• Algorithm Theory - SWAT 2004
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Complete mining of frequent patterns from graphs: Mining graph data
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Dynamic Graph Clustering Using Minimum-Cut Trees
• Finding all maximal cliques in dynamic graphs
• Finding all the perfect matchings in bipartite graphs
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 6783482 (Why is no real title available?)
• Reverse search for enumeration
• Sparsification—a technique for speeding up dynamic graph algorithms
• The worst-case time complexity for generating all maximal cliques and computational experiments

Cited in

(7)

• Speedup for a periodic subgraph miner
• Learning block-preserving graph patterns and its application to data mining
• Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
• Efficient algorithms for the periodic subgraphs mining problem
• Mining constrained cross-graph cliques in dynamic networks
• Mining evolving patterns of connection subgraphs over evolving graphs
• Mining preserving structures in a graph sequence

Describes a project that uses

Uses Software

• gSpan
• GraphScope

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)