Coverability of graph by three odd subgraphs.
Mirko PetrusevskiRiste SkrekovskiPublished in: J. Graph Theory (2019)
Keyphrases
- graph properties
- graph mining
- graph databases
- labeled graphs
- graph data
- subgraph mining
- frequent subgraph mining
- connected subgraphs
- graph structures
- directed graph
- graph representation
- maximum clique
- graph theory
- graph structure
- graph theoretic
- bipartite graph
- connected components
- graph model
- data structure
- reachability queries
- subgraph isomorphism
- quasi cliques
- graph patterns
- weighted graph
- random walk
- topological information
- subgraph matching
- graph search
- graph partitioning
- fixed number
- graph based algorithm
- graph matching
- relational data
- structured data
- pairwise
- dense subgraphs
- image segmentation
- social networks