Unpopularity Factor in the Marriage and Roommates Problems

03/26/2018
by   Suthee Ruangwises, et al.
0

We develop an algorithm to compute an unpopularity factor of a given matching in the Roommate Problem (RP) and Marriage Problem (MP). The algorithm runs in O(m√(n)^2 n) time for RP and in O(m√(n) n) time for MP.

READ FULL TEXT

page 1

page 2

page 3

research
01/31/2019

Quasi-Linear-Time Algorithm for Longest Common Circular Factor

We introduce the Longest Common Circular Factor (LCCF) problem in which,...
research
08/06/2022

Fast detection of specific fragments against a set of sequences

We design alignment-free techniques for comparing a sequence or word, ca...
research
05/31/2021

Multidimensional Included and Excluded Sums

This paper presents algorithms for the included-sums and excluded-sums p...
research
03/01/2020

An Algorithm for Consensus Trees

We consider the tree consensus problem, an important problem in bioinfor...
research
03/01/2020

Faster Greedy Consensus Trees

We consider the tree consensus problem, an important problem in bioinfor...
research
08/14/2017

On the Separation of a Polyhedron from Its Single-Part Mold

Casting is a manufacturing process where liquid material is poured into ...
research
09/02/2022

Optimal General Factor Problem and Jump System Intersection

In the optimal general factor problem, given a graph G=(V, E) and a set ...

Please sign up or login with your details

Forgot password? Click here to reset