Login / Signup

Forbidden subgraphs and bounds on the size of a maximum matching.

Michael D. PlummerAkira Saito
Published in: J. Graph Theory (2005)
Keyphrases
  • maximum matching
  • bipartite graph
  • upper bound
  • computational complexity
  • data structure
  • error bounds
  • stable set
  • orders of magnitude
  • vc dimension
  • lower and upper bounds
  • graph properties
  • worst case bounds