Scribd Logo
Upload

Welcome to Scribd!

  • 78 views

    AVL Tree Soviet Math - Doklady

    Uploaded by

    Avik Mitra
    An algorithm for organizing information is proposed that involves grouping related information together and ordering it to show relationships. The algorithm uses a data structure called an "interval graph" that represents relationships between information items and allows for efficient information retrieval. The algorithm was presented in a 1962 paper by G. M. Adel'son-Vel'skii and E. M. Landis and provides a way to systematically organize large amounts of information.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    AVL Tree Soviet Math - Doklady

    Uploaded by

    Avik Mitra
    78 views5 pages
    An algorithm for organizing information is proposed that involves grouping related information together and ordering it to show relationships. The algorithm uses a data structure called an "interval graph" that represents relationships between information items and allows for efficient information retrieval. The algorithm was presented in a 1962 paper by G. M. Adel'son-Vel'skii and E. M. Landis and provides a way to systematically organize large amounts of information.

    Original Description:

    This is the english translation of the original paper on AVL tree at Soviet Math, Doklady.

    Original Title

    AVL Tree Soviet Math_Doklady

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    An algorithm for organizing information is proposed that involves grouping related information together and ordering it to show relationships. The algorithm uses a data structure called an "interval graph" that represents relationships between information items and allows for efficient information retrieval. The algorithm was presented in a 1962 paper by G. M. Adel'son-Vel'skii and E. M. Landis and provides a way to systematically organize large amounts of information.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    78 views5 pages

    AVL Tree Soviet Math - Doklady

    Uploaded by

    Avik Mitra
    An algorithm for organizing information is proposed that involves grouping related information together and ordering it to show relationships. The algorithm uses a data structure called an "interval graph" that represents relationships between information items and allows for efficient information retrieval. The algorithm was presented in a 1962 paper by G. M. Adel'son-Vel'skii and E. M. Landis and provides a way to systematically organize large amounts of information.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 5

    An algorithm for the organization of information

    by G. M. Adel'son-Vel'skii and E. M. Landis


    Soviet Mathematics Doklady, 3, 1259-1263, 1962
    http://monet.skku.ac.kr
    Networkging Lab.

    You might also like