A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)
Yuri FaenzaGianpaolo OrioloClaudia SnelsPublished in: CoRR (2011)
Keyphrases
- graph structure
- weighted graph
- maximal cliques
- maximum clique
- graph theory
- directed acyclic graph
- graph representation
- graph model
- bipartite graph
- connected components
- graph databases
- similarity scores
- structured data
- pairwise
- directed graph
- link analysis
- neural network
- spanning tree
- invariant features
- graph theoretic
- random graphs