Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time

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.

Vahdat Niloofar; Moazzami Dara

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

Journal Paper

Paper Information

Journal: JOURNAL OF ALGORITHMS AND COMPUTATION Year:2018 | Volume:50 | Issue:2 Page(s): 81-87

Download Full-Text

View:

188

Download:

103

Cites:

Information Journal Paper

Title

Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time

Author(s)

Vahdat Niloofar | Moazzami Dara | Issue Writer Certificate

Keywords

vulnerability parameters

Tenacity

rupture de-gree

Interval graphs

Abstract

In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of Interval graphs are polynomial. In this paper, two di erent vulnerability parameters of graphs, Tenacity and rupture degree are de ned. In general, computing the Tenacity of a graph is NP-hard and the rupture degree of a graph is NP-complete, but in this paper, we will show that these parameters can be computed in polynomial time for Interval graphs.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Vahdat, Niloofar, & Moazzami, Dara. (2018). Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time. JOURNAL OF ALGORITHMS AND COMPUTATION, 50(2), 81-87. SID. https://sid.ir/paper/354567/en

Vancouver: Copy

Vahdat Niloofar, Moazzami Dara. Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time. JOURNAL OF ALGORITHMS AND COMPUTATION[Internet]. 2018;50(2):81-87. Available from: https://sid.ir/paper/354567/en

IEEE: Copy

Niloofar Vahdat, and Dara Moazzami, “Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time,” JOURNAL OF ALGORITHMS AND COMPUTATION, vol. 50, no. 2, pp. 81–87, 2018, [Online]. Available: https://sid.ir/paper/354567/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops