Login / Signup

Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures.

Kurt MehlhornGuido Schäfer
Published in: ACM J. Exp. Algorithmics (2002)
Keyphrases
  • data structure
  • special case
  • weighted graph
  • graph theoretic
  • graph model
  • efficient implementation
  • real time
  • decision trees
  • image segmentation
  • lower bound
  • closely related
  • graph matching