Takayoshi Hamaguchi

  • Citations Per Year
Learn More
In this paper, we give a characterization of a set of popular matchings in a bipartite graph with one-sided preference lists. The concept of a popular matching was first introduced by Gardenfors [5]. Recently, Abraham et al. [1] discussed a problem for finding a popular matching and proposed polynomial time algorithms for problem instances defined by(More)
  • 1