Can I read Maximum Uniquely Restricted Matchings in Permutation Graphs on EtoBox?

Maximum Uniquely Restricted Matchings in Permutation Graphs by Har Simrat Singh is a document available to read on EtoBox.

What is Maximum Uniquely Restricted Matchings in Permutation Graphs about?

1. The document discusses finding a maximum uniquely restricted matching (URM) in permutation graphs. A URM is a matching whose saturated vertices induce a subgraph with a unique perfect matching. 2. It presents definitions related to matchings and permutation graphs. It also presents theorems about URM and alternating cycles. 3. An algorithm called MaxURM is described that takes a permutation graph as input and outputs a maximum URM using procedures like initializing degrees, finding induced subgraphs,

Author

Har Simrat Singh

Language

EN