Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph.
Xueliang LiVictor Neumann-LaraEduardo Rivera-CampoPublished in: Ars Comb. (2005)
Keyphrases
- spanning tree
- undirected graph
- weighted graph
- edge weights
- minimum spanning trees
- minimum spanning tree
- edge disjoint
- neighborhood graph
- connected components
- subgraph isomorphism
- graph structure
- graph mining
- minimum cost
- graph model
- minimum weight
- vertex set
- graph databases
- graph properties
- graph structures
- dense subgraphs
- shortest path
- directed graph
- adjacency matrix
- random graphs
- graph theoretic
- approximation algorithms
- query graph
- strongly connected
- graph clustering
- reachability queries
- dynamic graph
- densely connected
- labeled graphs
- bipartite graph
- graph theory
- graph partitioning
- maximum clique
- leaf nodes
- graph search
- graph kernels
- graph data
- structured data
- subgraph matching
- knn