THE P-MEDIAN AND P-CENTER PROBLEMS ON BIPARTITE 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.

FATHALI JAFAR; JAFARIRAD NADER; RAHIMI SHERBAF SADEGH

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

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Sciences and Informatics Year:2014 | Volume:9 | Issue:2 Page(s): 37-43

Download Full-Text

View:

423

Download:

165

Cites:

Information Journal Paper

Title

THE P-MEDIAN AND P-CENTER PROBLEMS ON BIPARTITE GRAPHS

Author(s)

FATHALI JAFAR | JAFARIRAD NADER | RAHIMI SHERBAF SADEGH | Issue Writer Certificate

Keywords

LOCATION THEORY

P-MEDIAN

P-CENTER

BIPARTITE GRAPHS

Abstract

Let G be a bipartite graph. In this paper we consider the two kind of location problems namely P-CENTER and P-MEDIAN problems on BIPARTITE GRAPHS. The P-CENTER and P-MEDIAN problems asks to find a subset of vertices of cardinality p, so that respectively the maximum and sum of the distances from this set to all other vertices in G is minimized. For each case we present some properties to find exact solutions.

Cites

DISTANCE-BALANCED CLOSURE OF SOME GRAPHS

References

Cite

APA: Copy

FATHALI, JAFAR, JAFARIRAD, NADER, & RAHIMI SHERBAF, SADEGH. (2014). THE P-MEDIAN AND P-CENTER PROBLEMS ON BIPARTITE GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), 9(2), 37-43. SID. https://sid.ir/paper/310377/en

Vancouver: Copy

FATHALI JAFAR, JAFARIRAD NADER, RAHIMI SHERBAF SADEGH. THE P-MEDIAN AND P-CENTER PROBLEMS ON BIPARTITE GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI)[Internet]. 2014;9(2):37-43. Available from: https://sid.ir/paper/310377/en

IEEE: Copy

JAFAR FATHALI, NADER JAFARIRAD, and SADEGH RAHIMI SHERBAF, “THE P-MEDIAN AND P-CENTER PROBLEMS ON BIPARTITE GRAPHS,” IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), vol. 9, no. 2, pp. 37–43, 2014, [Online]. Available: https://sid.ir/paper/310377/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops