2021/11/17 by Sasmita Rout, Gautam K. Das, Rout, Sasmita +1
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2111.09040
openalex publication_date 2021/11/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
In the Roman domination problem, an undirected simple graph G(V,E) is given. The objective of Roman domination problem is to find a function f:V→ \0,1,2\ such that for any vertex v∈ V with f(v)=0 must be adjacent to at least one vertex u∈ V with f(u)=2 and ∑u∈ V f(u), called Roman domination number, is minimized. It is already proven that the Roman domination problem (RDP) is NP-complete for general graphs and it remains NP-complete for bipartite graphs. In this paper, we propose a dynamic programming based polynomial time algorithm for RDP in convex bipartite graph.