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