@article{(Open Science Index):https://publications.waset.org/pdf/10004512,
	  title     = {Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs},
	  author    = {Swapnil Gupta and  C. Pandu Rangan},
	  country	= {},
	  institution	= {},
	  abstract     = {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 contained in the latter, and
give O(|E|^2) time algorithms for both of them. It is to be noted that
both sub-classes are incomparable to proper interval graphs (graphs
obtained as the intersection graph of intervals in which no interval
completely contains another interval), on which the problem can be
solved in polynomial time.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {10},
	  number    = {6},
	  year      = {2016},
	  pages     = {980 - 989},
	  ee        = {https://publications.waset.org/pdf/10004512},
	  url   	= {https://publications.waset.org/vol/114},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 114, 2016},
	}