3 papers
cs.CG2022
Burning Number for the Points in the Plane
J. Mark Keil, Debajyoti Mondal, Ehsan Moradi
The burning process on a graph starts with a single burnt vertex, and at each subsequent step, burns the neighbors of the currently burnt vertices, as well as one other unburnt…
cs.DC2021
BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs
Ehsan Moradi, Debajyoti Mondal
Graph layouts are key to exploring massive graphs. An enormous number of nodes and edges do not allow network analysis software to produce meaningful visualization of the pervasive…
cs.CG2021
Finding a Maximum Clique in a Grounded 1-Bend String Graph
J. Mark Keil, Debajyoti Mondal, Ehsan Moradi +1
A grounded 1-bend string graph is an intersection graph of a set of polygonal lines, each with one bend, such that the lines lie above a common horizontal line and have exac…