120 citations · 605 across the 50 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019★ 9 cited
Hardness and approximation for the geodetic set problem in some graph classes
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat +2
In this paper, we study the computational complexity of finding the \emph{geodetic number} of graphs. A set of vertices of a graph is a \emph{geodetic set} if any vertex of…
cs.DM2011
On joint triangulations of two sets of points in the plane
Ajit Arvind Diwan, Subir Kumar Ghosh, Partha Pratim Goswami +1
In this paper, we establish two necessary conditions for a joint triangulation of two sets of points in the plane and conjecture that they are sufficient. We show that these ne…