Vishwa Prakash Hv

Vishwa Prakash Hv
Chennai Mathematical Institute · Computer Science Research Groups

Master of Science

About

2
Publications
125
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
1
Citation
Citations since 2017
2 Research Items
1 Citation
20172018201920202021202220230.00.20.40.60.81.0
20172018201920202021202220230.00.20.40.60.81.0
20172018201920202021202220230.00.20.40.60.81.0
20172018201920202021202220230.00.20.40.60.81.0
Learn about citations on ResearchGate
Introduction
Hi, I am a research scholar at Chennai Mathematical Institute. I am broadly interested in Algorithms and Graph theory.
Skills and Expertise
Theoretical Computer Science
Discrete Mathematics
Graph Τheory
Algorithm Analysis
Combinatorics
Computational Complexity Theory
Algorithm Development
Combinatorial Optimization
Graphs
Set Theory
Education
August 2018 - August 2020
Chennai Mathematical Institute
Chennai Mathematical Institute
Field of study
  • Theoretical Computer Science

Publications

Publications (2)
Disjoint Stable Matchings in Linear Time
Chapter
  • Sep 2021
The Gale-Shapley algorithm, which can find at most two (“extreme”) pairwise edge-disjoint stable matchings of \(G\) in linear time, and
Disjoint Stable Matchings in Linear Time
Preprint
Full-text available
  • Nov 2020
We show that given a SM instance G as input we can find a largest collection of pairwise edge-disjoint stable matchings of G in time linear in the input size. This extends two classical results: 1. The Gale-Shapley algorithm, which can find at most two ("extreme") pairwise edge-disjoint stable matchings of G in linear time, and 2. The polynomial-ti...

Network