Perfect matching cuts partitioning a graph into complementary subgraphs.
Diane CastonguayErika M. M. CoelhoHebert CoelhoJulliano R. NascimentoUéverton S. SouzaPublished in: CoRR (2022)
Keyphrases
- subgraph isomorphism
- graph matching
- graph mining
- graph partitioning
- min cut
- graph databases
- partitioning algorithm
- graph properties
- weighted graph
- matching algorithm
- graph structures
- graph data
- maximum matching
- subgraph mining
- maximum clique
- association graph
- bipartite graph
- connected subgraphs
- graph theory
- graph structure
- frequent subgraph mining
- labeled graphs
- directed graph
- query graph
- vertex set
- graph theoretic
- quasi cliques
- graph search
- subgraph matching
- graph patterns
- maximum weight
- spectral graph
- reachability queries
- matching process
- pattern matching
- keypoints
- minimum cut
- data structure
- graph model
- shape matching
- maximum cardinality
- edge weights
- graph representation
- random walk
- edit distance
- connected components
- structured data
- graph cuts
- feature points
- pairwise
- object recognition