Papers
Topics
Authors
Recent
Search
2000 character limit reached

Counting the Number of Minimum Roman Dominating Functions of a Graph

Published 5 Mar 2014 in cs.DS and cs.DM | (1403.1019v2)

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.

Citations (5)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Zheng Shi 
  2. Khee Meng Koh 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up