IDEAS home Printed from https://ideas.repec.org/a/spr/psycho/v60y1995i3p371-374.html
   My bibliography  Save this article

“Minimax length links” of a dissimilarity matrix and minimum spanning trees

Author

Listed:
  • J. Carroll

Abstract

No abstract is available for this item.

Suggested Citation

  • J. Carroll, 1995. "“Minimax length links” of a dissimilarity matrix and minimum spanning trees," Psychometrika, Springer;The Psychometric Society, vol. 60(3), pages 371-374, September.
    • Handle: RePEc:spr:psycho:v:60:y:1995:i:3:p:371-374
    DOI: 10.1007/BF02294381
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02294381
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02294381?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Karl Klauer, 1989. "Ordinal network representation: Representing proximities by graphs," Psychometrika, Springer;The Psychometric Society, vol. 54(4), pages 737-750, September.
    2. K. Klauer & J. Carroll, 1991. "A comparison of two approaches to fitting directed graphs to nonsymmetric proximity measures," Journal of Classification, Springer;The Classification Society, vol. 8(2), pages 251-268, December.
    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. K. Klauer & J. Carroll, 1989. "A mathematical programming approach to fitting general graphs," Journal of Classification, Springer;The Classification Society, vol. 6(1), pages 247-270, December.
    2. Henderson, Geraldine R. & Iacobucci, Dawn & Calder, Bobby J., 1998. "Brand diagnostics: Mapping branding effects using consumer associative networks," European Journal of Operational Research, Elsevier, vol. 111(2), pages 306-327, December.
    3. J. Hutchinson & Amitabh Mungale, 1997. "Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures," Psychometrika, Springer;The Psychometric Society, vol. 62(1), pages 85-117, March.
    4. Willem Heiser, 2013. "In memoriam, J. Douglas Carroll 1939–2011," Psychometrika, Springer;The Psychometric Society, vol. 78(1), pages 5-13, January.

    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:spr:psycho:v:60:y:1995:i:3:p:371-374. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.