activity
20092020
most citedSome Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

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

collaborators
Showing cs.DCShow all

1 paper · 1 filter

cs.DC2011

On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs

Esha Ghosh, Subhas K. Ghosh, C. Pandu Rangan

Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network whe…