Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs.
Tim DwyerChristopher MearsKerri MorganTodd NivenKim MarriottMark WallacePublished in: CoRR (2013)
Keyphrases
- graph theory
- graph representation
- directed graph
- graph mining
- graph theoretic
- graph structure
- adjacency matrix
- graph structures
- quasi cliques
- densely connected
- graph databases
- graph model
- labeled graphs
- weighted graph
- graph construction
- graph matching
- spanning tree
- graph partitioning
- graph classification
- graph data
- graph clustering
- graph theoretical
- series parallel
- power consumption
- maximum common subgraph
- graph isomorphism
- dynamic programming
- bipartite graph
- random graphs
- graph search
- dynamic graph
- graph drawing
- data compression
- graph properties
- optimal solution
- graph kernels
- connected graphs
- structural pattern recognition
- image compression
- graph transformation
- structured data
- association graph
- subgraph isomorphism
- maximal cliques
- community discovery
- connected components
- compression algorithm
- vertex set
- social graphs
- bounded treewidth
- directed acyclic
- finding the shortest path
- directed acyclic graph
- minimum spanning tree