Login / Signup

Eulerian straight ahead cycles in drawings of complete bipartite graphs.

Heiko Harborth
Published in: Discret. Math. (2001)
Keyphrases
  • bipartite graph
  • maximum matching
  • link prediction
  • minimum weight
  • maximum cardinality
  • maximum weight
  • bipartite graph matching
  • line segments
  • line drawings
  • graph clustering
  • mutual reinforcement