Login / Signup

Computing large matchings in planar graphs with fixed minimum degree.

Robert FrankeIgnaz RutterDorothea Wagner
Published in: Theor. Comput. Sci. (2011)
Keyphrases
  • planar graphs
  • higher order
  • minimum cost