Login / Signup

On the cyclic decomposition of complete graphs into almost-bipartite graphs.

Andrew BlincoSaad I. El-ZanatiCharles Vanden Eynden
Published in: Discret. Math. (2004)
Keyphrases
  • bipartite graph
  • graph clustering
  • maximum cardinality
  • maximum matching
  • graph model
  • bipartite graph matching
  • link prediction
  • minimum weight
  • edge weights
  • bipartite networks
  • random walk