Login / Signup

Short covering codes arising from matchings in weighted graphs.

Anderson N. MartinhãoEmerson L. Monte Carmelo
Published in: Math. Comput. (2013)
Keyphrases
  • weighted graph
  • minimum weight
  • regularization framework
  • shortest path
  • graph structure
  • data objects
  • edge weights
  • spanning tree
  • discrete data
  • data streams
  • dimensionality reduction