Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Hardness of Burning Number Problem on Regular Graphs
Dhanyamol Antony, L. Sunil Chandran, Anita Das +3
The Burning Number Problem (BNP) models the spread of information or contagion in a network through a discrete-time process on a graph. At each step, one new vertex is selected as…
cs.DS2023
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen +2
Domination and coloring are two classic problems in graph theory. The major focus of this paper is the CD-COLORING problem which combines the flavours of domination and colouring.…