IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/7677.html
   My bibliography  Save this paper

Generalized centrality in trees

Author

Listed:
  • Mulder, H.M.
  • Pelsmajer, M.J.
  • Reid, K.B.

Abstract

In 1982, Slater defined path subgraph analogues to the center, median, and (branch or branchweight) centroid of a tree. We define three families of central substructures of trees, including three types of central subtrees of degree at most D that yield the center, median, and centroid for D = 0 and Slater's path analogues for D = 2. We generalize these results concerning paths and include proofs that each type of generalized center and generalized centroid is unique. We also present algorithms for finding one or all generalized central substructures of each type.

Suggested Citation

  • Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    • Handle: RePEc:ems:eureir:7677
    as

    Download full text from publisher

    File URL: https://repub.eur.nl/pub/7677/ei2006-16.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. S. Mitchell Hedetniemi & E. J. Cockayne & S. T. Hedetniemi, 1981. "Linear Algorithms for Finding the Jordan Center and Path Center of a Tree," Transportation Science, INFORMS, vol. 15(2), pages 98-114, May.
    2. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    3. A. J. Goldman, 1971. "Optimal Center Location in Simple Networks," Transportation Science, INFORMS, vol. 5(2), pages 212-221, May.
    4. S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, June.
    5. G. Y. Handler, 1973. "Minimax Location of a Facility in an Undirected Tree Graph," Transportation Science, INFORMS, vol. 7(3), pages 287-293, August.
    6. A. J. Goldman, 1972. "Minimax Location of a Facility in a Network," Transportation Science, INFORMS, vol. 6(4), pages 407-418, November.
    7. Peter J. Slater, 1982. "Locating Central Paths in a Graph," Transportation Science, INFORMS, vol. 16(1), pages 1-18, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. ReVelle, C.S. & Eiselt, H.A. & Daskin, M.S., 2008. "A bibliography for some fundamental problem categories in discrete location science," European Journal of Operational Research, Elsevier, vol. 184(3), pages 817-848, February.
    2. Mehrdad Moshtagh & Jafar Fathali & James MacGregor Smith & Nezam Mahdavi-Amiri, 2019. "Finding an optimal core on a tree network with M/G/c/c state-dependent queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(1), pages 115-142, February.
    3. Hakimi, S.Louis, 1983. "Network location theory and contingency planning," Energy, Elsevier, vol. 8(8), pages 697-702.
    4. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    5. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    6. Vladimir Marianov & Daniel Serra, 2009. "Median problems in networks," Economics Working Papers 1151, Department of Economics and Business, Universitat Pompeu Fabra.
    7. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
    8. Jafar Fathali & Mehdi Zaferanieh, 2023. "The balanced 2-median and 2-maxian problems on a tree," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-16, March.
    9. Becker, Ronald I. & Lari, Isabella & Scozzari, Andrea, 2007. "Algorithms for central-median paths with bounded length on trees," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1208-1220, June.
    10. Wei Ding & Ke Qiu, 2017. "An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1084-1095, November.
    11. Wei Ding & Ke Qiu & Yu Zhou & Zhou Ye, 2022. "A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 905-920, September.
    12. Mehdi Zaferanieh & Jafar Fathali, 2012. "Finding a core of a tree with pos/neg weight," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 147-160, October.
    13. Marianov, Vladimir & Eiselt, H.A., 2024. "Fifty Years of Location Theory - A Selective Review," European Journal of Operational Research, Elsevier, vol. 318(3), pages 701-718.
    14. Rainer E. Burkard & Johannes Hatzl, 2010. "Median problems with positive and negative weights on cycles and cacti," Journal of Combinatorial Optimization, Springer, vol. 20(1), pages 27-46, July.
    15. Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi, 2020. "Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks," Annals of Operations Research, Springer, vol. 289(2), pages 153-172, June.
    16. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    17. Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
    18. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    19. Wen, Meilin & Iwamura, Kakuzo, 2008. "Fuzzy facility location-allocation problem under the Hurwicz criterion," European Journal of Operational Research, Elsevier, vol. 184(2), pages 627-635, January.
    20. Zvi Drezner & G. O. Wesolowsky, 1991. "Facility location when demand is time dependent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 763-777, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ems:eureir:7677. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.