Login / Signup

Edge Pushing is Equivalent to Vertex Elimination for Computing Hessians.

Mu WangAlex PothenPaul D. Hovland
Published in: CSC (2016)
Keyphrases
  • edge detection
  • edge information
  • undirected graph
  • strongly connected
  • vertex set
  • case study
  • hidden markov models
  • region growing
  • weighted graph
  • hamiltonian cycle