Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs.
Tim DwyerChristopher MearsKerri MorganTodd NivenKim MarriottMark WallacePublished in: PacificVis (2014)
Keyphrases
- graph matching
- directed graph
- graph theory
- graph representation
- quasi cliques
- graph structure
- graph databases
- weighted graph
- graph classification
- graph mining
- graph construction
- graph model
- labeled graphs
- graph search
- graph theoretical
- graph structures
- graph theoretic
- graph clustering
- random graphs
- adjacency matrix
- graph partitioning
- undirected graph
- densely connected
- graph kernels
- series parallel
- graph data
- subgraph isomorphism
- image compression
- power consumption
- maximum clique
- graph properties
- bipartite graph
- spanning tree
- reachability queries
- graph patterns
- maximal cliques
- planar graphs
- graph layout
- graph isomorphism
- graph transformation
- neighborhood graph
- structural pattern recognition
- graph drawing
- topological information
- optimal solution
- minimum spanning tree
- small world
- edge weights
- structured data
- compression ratio
- inexact graph matching
- graph representations
- maximum cardinality
- random walk
- massive graphs
- dense subgraphs
- data compression
- dynamic graph
- web graph
- polynomial time complexity
- adjacency graph
- bounded treewidth