Login / Signup
On embedding graphs with bounded sum of size and maximum degree.
Andrzej Zak
Published in:
Discret. Math. (2014)
Keyphrases
</>
maximum number
bounded treewidth
graph embedding
graph matching
bounded degree
computational complexity
np complete
random graphs
uniform random
objective function
vector space
directed graph
graph theory
graph kernels
maximal cliques