Compressing Graphs and Indexes with Recursive Graph Bisection.
Laxman DhulipalaIgor KabiljoBrian KarrerGiuseppe OttavianoSergey PupyrevAlon ShalitaPublished in: KDD (2016)
Keyphrases
- graph representation
- vertex set
- graph theory
- graph structure
- graph databases
- weighted graph
- graph matching
- directed graph
- adjacency matrix
- graph model
- graph mining
- graph properties
- graph theoretic
- labeled graphs
- graph classification
- graph construction
- graph structures
- series parallel
- graph search
- random graphs
- graph partitioning
- graph theoretical
- graph clustering
- subgraph isomorphism
- graph transformation
- graph data
- spanning tree
- structural pattern recognition
- graph drawing
- bipartite graph
- graph representations
- graph kernels
- graph isomorphism
- undirected graph
- dense subgraphs
- maximum common subgraph
- directed acyclic
- dynamic graph
- social graphs
- graph layout
- massive graphs
- evolving graphs
- edge weights
- web graph
- connected graphs
- inexact graph matching
- structured data
- finding the shortest path
- disk resident
- polynomial time complexity
- connected dominating set
- maximal cliques
- real world graphs
- random walk
- query graph
- attributed graphs
- topological information
- minimum spanning tree
- neighborhood graph
- connected components
- data compression
- small world
- maximum cardinality
- graph patterns
- average degree
- maximum clique
- frequent subgraphs
- social networks
- proximity graph
- query processing