Finding popular branchings in vertex-weighted digraphs

Kei Natsui, Kenjiro Takazawa

Popular matchings have been intensively studied recently as a relaxed concept of stable matchings. By applying the concept of popular matchings to branchings in directed graphs, Ka…