Covering the edges of a graph by three odd subgraphs.
Tamás MátraiPublished in: J. Graph Theory (2006)
Keyphrases
- directed graph
- weighted graph
- graph properties
- graph mining
- graph databases
- spanning tree
- undirected graph
- graph structures
- directed acyclic graph
- massive graphs
- spectral embedding
- graph data
- frequent subgraph mining
- subgraph isomorphism
- vertex set
- real world graphs
- labeled graphs
- topological information
- subgraph mining
- edge weights
- connected subgraphs
- graph representation
- reachability queries
- graph structure
- random walk
- graph theory
- maximum matching
- subgraph matching
- structured data
- maximum clique
- query graph
- data structure
- frequent subgraphs
- maximal cliques
- graph model
- graph clustering
- graph theoretic
- multiscale
- edge information
- connected components
- bipartite graph
- dense subgraphs
- nodes of a graph
- edge detector
- relational data
- graph matching
- link analysis
- graph partitioning
- graph search