Login / Signup

Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth.

Martin FürerCarlos HoppenVilmar Trevisan
Published in: ICALP (2020)
Keyphrases
  • symmetric matrices
  • upper bound
  • bounded treewidth
  • feature selection
  • clustering algorithm
  • graph matching
  • graph representation