View in EDS PDF Full Text

SUCCINCT REPRESENTATION OF BALANCED PARENTHESES AND STATIC TREES.

Saved in:
Bibliographic Details
Title: SUCCINCT REPRESENTATION OF BALANCED PARENTHESES AND STATIC TREES.
Authors: Munro, J. Ian, Raman, Venkatesh
Source: SIAM Journal on Computing. 2001, Vol. 31 Issue 3, p762. 15p.
Subjects: Abstract data types (Computer science), Binary number system, Graphic methods, Research
Abstract: We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced sequence of parentheses. Our representations use an amount of space within a lower order term of the information theoretic minimum and support, in constant time, a richer set of navigational operations than has previously been considered in similar work. In the case of binary trees, for instance, we can move from a node to its left or right child or to the parent in constant time while retaining knowledge of the size of the subtree at which we are positioned. The approach is applied to produce a succinct representation of planar graphs in which one can test adjacency in constant time. [ABSTRACT FROM AUTHOR]
Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 10209824
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: SUCCINCT REPRESENTATION OF BALANCED PARENTHESES AND STATIC TREES.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Munro%2C+J%2E+Ian%22">Munro, J. Ian</searchLink><br /><searchLink fieldCode="AR" term="%22Raman%2C+Venkatesh%22">Raman, Venkatesh</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22SIAM+Journal+on+Computing%22">SIAM Journal on Computing</searchLink>. 2001, Vol. 31 Issue 3, p762. 15p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Abstract+data+types+%28Computer+science%29%22">Abstract data types (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Binary+number+system%22">Binary number system</searchLink><br /><searchLink fieldCode="DE" term="%22Graphic+methods%22">Graphic methods</searchLink><br /><searchLink fieldCode="DE" term="%22Research%22">Research</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced sequence of parentheses. Our representations use an amount of space within a lower order term of the information theoretic minimum and support, in constant time, a richer set of navigational operations than has previously been considered in similar work. In the case of binary trees, for instance, we can move from a node to its left or right child or to the parent in constant time while retaining knowledge of the size of the subtree at which we are positioned. The approach is applied to produce a succinct representation of planar graphs in which one can test adjacency in constant time. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=10209824
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1137/S0097539799364092
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 15
        StartPage: 762
    Subjects:
      – SubjectFull: Abstract data types (Computer science)
        Type: general
      – SubjectFull: Binary number system
        Type: general
      – SubjectFull: Graphic methods
        Type: general
      – SubjectFull: Research
        Type: general
    Titles:
      – TitleFull: SUCCINCT REPRESENTATION OF BALANCED PARENTHESES AND STATIC TREES.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Munro, J. Ian
      – PersonEntity:
          Name:
            NameFull: Raman, Venkatesh
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: 2001
              Type: published
              Y: 2001
          Identifiers:
            – Type: issn-print
              Value: 00975397
          Numbering:
            – Type: volume
              Value: 31
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: SIAM Journal on Computing
              Type: main
ResultId 1