Graph entropy rate minimization and the compressibility of undirected binary graphs.
Marcos E. BolanosSelin AviyenteHayder RadhaPublished in: SSP (2012)
Keyphrases
- weighted graph
- directed graph
- undirected graph
- graph structure
- directed edges
- graph representation
- adjacency matrix
- graph theory
- graph model
- code length
- graph properties
- graph structures
- graph matching
- graph databases
- graph partitioning
- graph theoretic
- graph construction
- labeled graphs
- edge weights
- spanning tree
- subgraph isomorphism
- graph theoretical
- random walk
- minimum spanning tree
- graph clustering
- graph mining
- graph transformation
- graph search
- random graphs
- gray code
- web graph
- graph isomorphism
- graph data
- directed acyclic graph
- bipartite graph
- information theoretic
- connected components
- series parallel
- structural pattern recognition
- attributed graphs
- graph drawing
- small world
- dynamic graph
- graph classification
- graph representations
- connected dominating set
- objective function
- massive graphs
- finding the shortest path
- inexact graph matching
- adaptive binary arithmetic coding
- maximum common subgraph
- adjacency graph
- query graph
- topological information
- neighborhood graph
- approximation algorithms
- structured data
- shortest path
- graphical models