Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs.
Diane CastonguayErika M. M. CoelhoHebert CoelhoJulliano R. NascimentoUéverton S. SouzaPublished in: IWOCA (2022)
Keyphrases
- subgraph isomorphism
- graph matching
- graph properties
- graph databases
- graph mining
- graph partitioning
- labeled graphs
- subgraph mining
- bipartite graph
- partitioning algorithm
- graph data
- maximum matching
- association graph
- min cut
- maximum clique
- matching algorithm
- maximum cardinality
- reachability queries
- frequent subgraph mining
- graph structures
- weighted graph
- vertex set
- graph theory
- structured data
- maximal cliques
- stable set
- graph model
- spectral graph
- pattern matching
- data structure
- graph patterns
- graph structure
- maximum weight
- subgraph matching
- quasi cliques
- maximum common subgraph
- frequent subgraphs
- topological information
- graph theoretic
- connected components
- query graph
- relational structures
- graph clustering
- shape matching
- connected subgraphs
- pattern mining
- random walk
- feature points