Login / Signup

Hard coloring problems in low degree planar bipartite graphs.

Miroslav ChlebíkJanka Chlebíková
Published in: Discret. Appl. Math. (2006)
Keyphrases
  • bipartite graph
  • link prediction
  • low degree
  • maximum matching
  • machine learning
  • feature selection
  • supervised learning
  • np complete
  • loss function