C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Optimization of eigenvalue bounds for the independence and chromatic number of graph powers.
Aida Abiad
Gabriel Coutinho
Miguel Angel Fiol
Bruno Demattos Nogueira
S. Zeijlemaker
Published in:
Discret. Math. (2022)
Keyphrases
</>
maximum number
small number
neural network
optimization problems
computational complexity
lower bound
probability distribution
worst case
optimization algorithm
directed graph
ranking algorithm
graph matching
bipartite graph
graph partitioning