Graph Compositions: Deleting Edges from Complete Graphs.
Todd TichenorMichael E. MaysPublished in: Integers (2015)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- real world graphs
- edge weights
- spanning tree
- massive graphs
- spectral embedding
- graph mining
- graph theory
- graph structure
- directed edges
- graph representation
- connected components
- graph structures
- graph databases
- graph construction
- graph properties
- adjacency matrix
- graph model
- labeled graphs
- random walk
- nodes of a graph
- graph matching
- graph clustering
- graph theoretic
- directed acyclic graph
- random graphs
- graph partitioning
- vertex set
- series parallel
- community detection
- graph classification
- subgraph isomorphism
- minimum spanning tree
- social networks
- reachability queries
- bipartite graph
- graph data
- graph theoretical
- minimum cost
- shortest path
- directed acyclic
- graph search
- graph isomorphism
- graph transformation
- dynamic graph
- neighborhood graph
- connected dominating set
- connected graphs
- complex networks
- dense subgraphs
- graph kernels
- community discovery
- densely connected
- planar graphs
- adjacency graph
- structural pattern recognition
- query graph
- graph embedding
- inexact graph matching
- power law distribution
- power law
- attributed graphs