Login / Signup

Short coverings and matching in weighted graphs.

Anderson N. MartinhãoEmerson L. Monte Carmelo
Published in: Electron. Notes Discret. Math. (2011)
Keyphrases
  • weighted graph
  • shortest path
  • matching algorithm
  • subgraph isomorphism
  • regularization framework
  • graph structure
  • discrete data
  • data objects
  • graph matching
  • rough sets
  • data sources
  • graph connectivity