Login / Signup

Finding Cliques in Directed Weighted Graphs Using Complex Hermitian Adjacency Matrices.

Bettina HoserThomas Bierhance
Published in: GfKl (2006)
Keyphrases
  • weighted graph
  • shortest path
  • graph structure
  • singular values
  • high level
  • regularization framework
  • machine learning
  • spanning tree