A matheuristic approach for the maximum balanced subgraph of a signed graph.
Jorge Reynaldo Moreno RamírezYuri Abitbol de Menezes FrotaSimone de Lima MartinsPublished in: RAIRO Oper. Res. (2021)
Keyphrases
- graph mining
- graph databases
- graph properties
- graph data
- subgraph isomorphism
- graph classification
- maximum matching
- labeled graphs
- frequent subgraph mining
- maximum weight
- graph representation
- graph theory
- query graph
- graph structure
- graph search
- graph theoretic
- stable set
- connected components
- random walk
- similarity graph
- subgraph mining
- subgraph matching
- structured data
- directed graph
- bipartite graph
- graph model
- maximum clique
- search algorithm
- dense subgraphs
- graph partitioning
- graph structures
- weighted graph
- graph kernels
- graph matching
- graph based algorithm
- pattern mining
- edge weights
- np hard
- graph clustering