Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs

@inproceedings{Gupta2016ComputingMU,
  title={Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs},
  author={Swapnil Gupta and C. Pandu Rangan},
  year={2016}
}
A uniquely restricted matching is defined to be a matching M whose matched vertices induces a sub-graph which has only one perfect matching. In this paper, we make progress on the open question of the status of this problem on interval graphs (graphs obtained as the intersection graph of intervals on a line). We give an algorithm to compute maximum cardinality uniquely restricted matchings on certain sub-classes of interval graphs. We consider two sub-classes of interval graphs, the former… CONTINUE READING