On the kernel size of clique cover reductions for random intersection graphs.
Tobias FriedrichChristian HercherPublished in: J. Discrete Algorithms (2015)
Keyphrases
- maximum clique
- maximal cliques
- maximal clique enumeration
- graph properties
- graph theoretic
- graph theory
- graph kernels
- small size
- graph clustering
- kernel methods
- graph matching
- graph model
- bipartite graph
- computational biology
- kernel learning
- graph databases
- graph embedding
- graph structure
- quasi cliques
- memory requirements