Automatic Abstraction of Graphs Based on Node Similarity for Graph Visualization.
Xiaodi HuangWei LaiPublished in: SEKE (2003)
Keyphrases
- graph structure
- directed graph
- graph layout
- graph drawing
- finding the shortest path
- maximum common subgraph
- undirected graph
- edge weights
- graph theory
- weighted graph
- inexact graph matching
- graph matching
- graph representation
- graph model
- nodes of a graph
- graph structures
- labeled graphs
- graph theoretical
- similarity graph
- graph properties
- graph construction
- graph theoretic
- graph partitioning
- subgraph isomorphism
- adjacency matrix
- graph databases
- graph search
- graph mining
- betweenness centrality
- graph clustering
- multidimensional scaling
- graph representations
- shortest path
- random graphs
- directed acyclic graph
- graph classification
- graph data
- densely connected
- directed acyclic
- random walk
- graphical models
- normalized cut
- similarity measure
- spanning tree
- information visualization
- structural pattern recognition
- dynamic graph
- graph kernels
- tree structure
- complex networks
- reachability queries
- graph isomorphism
- bipartite graph
- maximum clique
- degree distribution
- strongly connected
- topological information
- edit distance
- similarity scores
- similarity function
- dense subgraphs
- small world
- series parallel
- adjacency graph
- bounded treewidth
- graph patterns
- neighborhood graph
- small world networks
- attributed graphs