Login / Signup

On NP-hard graph properties characterized by the spectrum.

Omid EtesamiWillem H. Haemers
Published in: Discret. Appl. Math. (2020)
Keyphrases
  • graph properties
  • np hard
  • graph theoretic
  • graph theory
  • directed graph
  • optimal solution
  • clustering coefficient
  • minimum cost
  • social networks
  • high throughput
  • database
  • databases
  • query processing
  • graph data