Mining preserving structures in a graph sequence

DOI10.1016/j.tcs.2015.12.007zbMath1353.68218OpenAlexW1573982677MaRDI QIDQ344786

Yushi Uno, Takeaki 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

enumerationdata miningtrajectory mininggraph sequencepolynomial delaypreserving structurestructure mining

Mathematics Subject Classification ID

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

Uses Software

• gSpan
• GraphScope

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Mining preserving structures in a graph sequence