Graph vulnerability parameters, compression, and quasi-threshold graphs.
Nathan KahlPublished in: Discret. Appl. Math. (2019)
Keyphrases
- image quality
- graph representation
- graph theory
- graph matching
- graph structure
- directed graph
- weighted graph
- series parallel
- graph model
- graph search
- graph mining
- graph properties
- graph clustering
- graph theoretical
- graph theoretic
- labeled graphs
- structural pattern recognition
- evolving graphs
- undirected graph
- graph partitioning
- bipartite graph
- graph databases
- adjacency matrix
- threshold values
- subgraph isomorphism
- random walk
- data compression
- graph classification
- graph construction
- graph patterns
- random graphs
- graph kernels
- graph structures
- graph representations
- spanning tree
- minimum spanning tree
- graph data
- edge weights
- adjacency graph
- reachability queries
- disk resident
- image compression
- web graph
- maximum cardinality
- quasi cliques
- graph layout
- dynamic graph
- graph isomorphism
- real world graphs
- compression algorithm
- maximum clique
- association graph
- attributed graphs
- planar graphs