AN EFFICIENT ALGORITHM FOR MIXED DOMINATION ON GENERALIZED SERIES-PARALLEL GRAPHS

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.

Rajaati M.; HOOSHMANDASL M.R.; SHAKIBA A.; Sharifani P.; Dinneen M.J.

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

Journal Paper

Paper Information

Journal: Algebraic structures and their applications Year:2018 | Volume:5 | Issue:1 Page(s): 23-39

Download Full-Text

View:

231

Download:

Cites:

Information Journal Paper

Title

AN EFFICIENT ALGORITHM FOR MIXED DOMINATION ON GENERALIZED SERIES-PARALLEL GRAPHS

Author(s)

Keywords

Mixed Dominating Set

Generalized Series-Parallel

Parse Tree

Tree-widt

Abstract

A Mixed Dominating Set S of a graph G = (V; E) is a subset of vertices and edges like S V [ E such that each element v 2 (V [ E) n S is adjacent or incident to at least one element in S. The mixed domination number m(G) of a graph G is the minimum cardinality among all Mixed Dominating Sets in G. The problem of finding m(G) is known to be NP-complete. In this paper, we present an explicit polynomial-time algorithm using the Parse Tree to construct a Mixed Dominating Set of size m(G) where G is a Generalized Series-Parallel graph.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Rajaati, M., HOOSHMANDASL, M.R., SHAKIBA, A., Sharifani, P., & Dinneen, M.J.. (2018). AN EFFICIENT ALGORITHM FOR MIXED DOMINATION ON GENERALIZED SERIES-PARALLEL GRAPHS. ALGEBRAIC STRUCTURES AND THEIR APPLICATIONS, 5(1), 23-39. SID. https://sid.ir/paper/354250/en

Vancouver: Copy

Rajaati M., HOOSHMANDASL M.R., SHAKIBA A., Sharifani P., Dinneen M.J.. AN EFFICIENT ALGORITHM FOR MIXED DOMINATION ON GENERALIZED SERIES-PARALLEL GRAPHS. ALGEBRAIC STRUCTURES AND THEIR APPLICATIONS[Internet]. 2018;5(1):23-39. Available from: https://sid.ir/paper/354250/en

IEEE: Copy

M. Rajaati, M.R. HOOSHMANDASL, A. SHAKIBA, P. Sharifani, and M.J. Dinneen, “AN EFFICIENT ALGORITHM FOR MIXED DOMINATION ON GENERALIZED SERIES-PARALLEL GRAPHS,” ALGEBRAIC STRUCTURES AND THEIR APPLICATIONS, vol. 5, no. 1, pp. 23–39, 2018, [Online]. Available: https://sid.ir/paper/354250/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops