ON THE COMPUTATIONAL COMPLEXITY OF THE DOMINATION GAME

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KLAVZAR SANDI; KOSMRLJ GASPER; SCHMIDT SIMON

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Sciences and Informatics Year:2015 | Volume:10 | Issue:2 Page(s): 115-122

Download Full-Text

View:

376

Download:

157

Cites:

Information Journal Paper

Title

ON THE COMPUTATIONAL COMPLEXITY OF THE DOMINATION GAME

Author(s)

KLAVZAR SANDI | KOSMRLJ GASPER | SCHMIDT SIMON | Issue Writer Certificate

Keywords

DOMINATION GAME

GAME DOMINATION NUMBER

COMPLEXITY OF AL GORITHMS

Abstract

The DOMINATION GAME is played on an arbitrary graph G by two players, Dominator and Staller. It is known that verifying whether the GAME DOMINATION NUMBER of a graph is bounded by a given integer k is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph G in O(D(G).|V (G)|k) time. In the special case when k=3 and the graph G considered has maximum diameter, the complexity is improved to O(|V (G)|.|E(G)|+D(G)3).

Cites

No record.

References

Cite

APA: Copy

KLAVZAR, SANDI, KOSMRLJ, GASPER, & SCHMIDT, SIMON. (2015). ON THE COMPUTATIONAL COMPLEXITY OF THE DOMINATION GAME. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), 10(2), 115-122. SID. https://sid.ir/paper/310407/en

Vancouver: Copy

KLAVZAR SANDI, KOSMRLJ GASPER, SCHMIDT SIMON. ON THE COMPUTATIONAL COMPLEXITY OF THE DOMINATION GAME. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI)[Internet]. 2015;10(2):115-122. Available from: https://sid.ir/paper/310407/en

IEEE: Copy

SANDI KLAVZAR, GASPER KOSMRLJ, and SIMON SCHMIDT, “ON THE COMPUTATIONAL COMPLEXITY OF THE DOMINATION GAME,” IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), vol. 10, no. 2, pp. 115–122, 2015, [Online]. Available: https://sid.ir/paper/310407/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops