H-Decompositions of r-graphs when H is an r-graph with exactly 2 edges.
Teresa SousaPublished in: Electron. J. Comb. (2010)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- edge weights
- real world graphs
- spanning tree
- massive graphs
- graph structure
- spectral embedding
- graph representation
- adjacency matrix
- graph construction
- graph matching
- graph model
- graph mining
- graph theory
- graph structures
- directed edges
- labeled graphs
- graph classification
- directed acyclic graph
- graph partitioning
- graph databases
- bipartite graph
- vertex set
- graph theoretical
- graph properties
- graph theoretic
- graph search
- connected components
- nodes of a graph
- random walk
- graph clustering
- minimum spanning tree
- graph data
- web graph
- subgraph isomorphism
- series parallel
- graph transformation
- maximum cardinality
- graph kernels
- random graphs
- graph isomorphism
- community detection
- densely connected
- structural pattern recognition
- graph representations
- topological information
- minimum cost
- maximum common subgraph
- graph drawing
- graph layout
- inexact graph matching
- connected dominating set
- graph patterns
- evolving graphs
- dynamic graph
- power law
- complex networks
- structured data
- shortest path