Counting the Number of Minimum Roman Dominating Functions of a Graph
Abstract
We provide two algorithms counting the number of minimum Roman dominating functions of a graph on n vertices in O(1.5673n) time and polynomial space. We also show that the time complexity can be reduced to O(1.5014n) if exponential space is used. Our result is obtained by transforming the Roman domination problem into other combinatorial problems on graphs for which exact algorithms already exist.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.