Highly edge-connected regular graphs without large factorizable subgraphs.
Davide MattioloEckhard SteffenPublished in: J. Graph Theory (2022)
Keyphrases
- graph mining
- weighted graph
- graph databases
- subgraph isomorphism
- graph properties
- subgraph matching
- labeled graphs
- connected components
- undirected graph
- reachability queries
- graph structures
- maximum common subgraph
- connected subgraphs
- graph data
- maximum clique
- subgraph mining
- frequent subgraph mining
- frequent subgraphs
- dense subgraphs
- query graph
- minimum spanning trees
- connected graphs
- graph patterns
- graph theoretic
- adjacency graph
- pattern mining
- edge detection
- quasi cliques
- graph model
- data structure
- vertex set
- neighborhood graph
- graph representation
- graph theory
- densely connected
- structured data
- graph matching
- binary images
- directed graph
- maximal cliques
- community discovery
- data objects
- biological networks
- graph partitioning