H-Decomposition of r-Graphs when H is an r-Graph with Exactly k Independent Edges.
Xinmin HouBoyuan LiuHongliang LuPublished in: Graphs Comb. (2019)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- edge weights
- real world graphs
- spanning tree
- massive graphs
- structural learning
- graph mining
- spectral embedding
- graph structure
- adjacency matrix
- graph structures
- graph theory
- graph clustering
- directed acyclic graph
- graph matching
- graph model
- graph databases
- strongly connected components
- graph properties
- nodes of a graph
- connected components
- bipartite graph
- graph partitioning
- graph representation
- directed edges
- labeled graphs
- graph construction
- random walk
- vertex set
- graph theoretic
- series parallel
- random graphs
- minimum spanning tree
- shortest path
- densely connected
- graph search
- dense subgraphs
- reachability queries
- dynamic graph
- graph isomorphism
- minimum cost
- graph data
- frequent subgraphs
- evolving graphs
- complex networks
- graph theoretical
- graph classification
- query graph
- graph representations
- strongly connected
- social graphs
- maximal cliques
- graph layout
- tree decomposition
- graph kernels
- community detection
- neighborhood graph
- graph drawing
- structural pattern recognition