A clique-free pseudorandom subgraph of the pseudo polarity graph.
Sam MattheusFrancesco PavesePublished in: Discret. Math. (2022)
Keyphrases
- pseudorandom
- maximum weight
- graph properties
- maximum clique
- bipartite graph
- graph mining
- quasi cliques
- random number
- graph theory
- graph databases
- uniformly distributed
- directed graph
- graph theoretic
- graph data
- independent set
- weighted graph
- graph classification
- minimum weight
- sentiment analysis
- association graph
- subgraph mining
- random walk
- np hard
- random numbers
- secret key
- subgraph isomorphism
- graph search
- labeled graphs
- graph structure
- maximum matching
- structured data
- encryption algorithm
- spanning tree
- graph model
- graph matching
- frequent subgraph mining
- maximal cliques
- smart card
- connected subgraphs