C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups.
Noga Alon
Clara Shikhelman
Published in:
Discret. Math. (2019)
Keyphrases
</>
computational complexity
maximum number
small number
data sets
graphical models
graph representation
maximum clique
subgraph matching