Gopinath Mishra

activity

20242026

most citedArboricity Matters in Triangle Counting with Random Edges

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025★ 1 cited

Arboricity Matters in Triangle Counting with Random Edges

Arijit Bishnu, Debarshi Chanda, Gopinath Mishra

Given a simple, unweighted, undirected graph $G = (V, E)$ with $∣ V ∣ = n$ and $∣ E ∣ = m$ , and parameters $0 < ε, δ < 1$ , along with Degree, Neighbour, Pair and RandomEdge query acce…

cs.DS2025

Optimal Distributed Replacement Paths

Yi-Jun Chang, Yanyu Chen, Dipan Dey +3

We study the replacement paths problem in the $CONGEST$ model of distributed computing. Given an $s$ - $t$ shortest path $P$ , the goal is to compute, for every edge $e$ in $…

cs.DS2024

Round and Communication Efficient Graph Coloring

Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen +1

In the context of communication complexity, we explore protocols for graph coloring, focusing on the vertex and edge coloring problems in $n$ -vertex graphs $G$ with a maximum degre…