Login / Signup

A quadratic identity for the number of perfect matchings of plane graphs.

Weigen YanFuji Zhang
Published in: Theor. Comput. Sci. (2008)
Keyphrases
  • computational complexity
  • small number
  • graph matching
  • database
  • databases
  • case study
  • lower bound
  • bipartite graph
  • maximum number
  • graph theoretic
  • identity management