Graph topology recovery for regular and irregular graphs.
Rohan VarmaSiheng ChenJelena KovacevicPublished in: CAMSAP (2017)
Keyphrases
- graph theory
- small world
- graph structure
- weighted graph
- topological information
- graph representation
- graph theoretic
- graph matching
- directed graph
- graph databases
- graph construction
- adjacency matrix
- labeled graphs
- graph mining
- graph partitioning
- random graphs
- graph theoretical
- series parallel
- graph properties
- fully connected
- graph structures
- graph data
- graph search
- graph model
- subgraph isomorphism
- graph representations
- graph classification
- graph isomorphism
- undirected graph
- graph clustering
- bipartite graph
- structural pattern recognition
- planar graphs
- graph transformation
- graph kernels
- reachability queries
- random walk
- spanning tree
- dynamic graph
- directed acyclic
- evolving graphs
- connected graphs
- inexact graph matching
- graph embedding
- attributed graphs
- neighborhood graph
- real world graphs
- minimum spanning tree
- average degree
- finding the shortest path
- disk resident
- graph layout
- edge weights
- maximal cliques
- maximum common subgraph
- maximum independent set
- connected components
- maximum cardinality
- web graph
- proximity graph
- power law
- maximum clique
- spectral decomposition
- directed acyclic graph
- massive graphs
- graph drawing
- link analysis
- polynomial time complexity
- graph patterns
- complex networks
- social networks
- connected dominating set