A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants).
Yuri FaenzaGianpaolo OrioloClaudia SnelsPublished in: Oper. Res. Lett. (2011)
Keyphrases
- graph structure
- weighted graph
- maximum clique
- maximal cliques
- graph representation
- graph theory
- graph matching
- directed graph
- random walk
- graph model
- pairwise
- structured data
- association graph
- graph partitioning
- graph theoretic
- dependency graph
- random variables
- similarity scores
- functional modules
- pairwise similarities
- graph based algorithm
- neural network