• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On the number of irreducible coverings by edges of complete bipartite graphs.

Ioan Tomescu
Published in: Discret. Math. (1996)
Keyphrases
  • bipartite graph
  • edge weights
  • learning algorithm
  • social networks
  • directed acyclic graph