Open access
Date
1991Type
- Report
ETH Bibliography
yes
Altmetrics
Abstract
The linearization of general graphs represented by pointer and record data structures is a problem often arising in computer programs. Whenever a graph has to be stored on or transmitted over a sequentially organized carrier, a form of linearization is used. A simple algorithm for this purpose is presented and a special application – the writing of symbol files as required by modern language compilers – is described in more detail. Show more
Permanent link
https://doi.org/10.3929/ethz-a-000582229Publication status
publishedJournal / series
ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für ComputersystemeVolume
Publisher
Eidgenössische Technische Hochschule ZürichSubject
GRAPHENTHEORIE (MATHEMATIK); COMPILER (PROGRAMMIERSPRACHEN); GRAPH THEORY (MATHEMATICS); Linearization; COMPILERS (PROGRAMMING LANGUAGES); OBERON (PROGRAMMIERSPRACHEN); Graphs; OBERON (PROGRAMMING LANGUAGES); Symbol FilesOrganisational unit
02150 - Dep. Informatik / Dep. of Computer Science
Notes
Technical Reports D-INFK.More
Show all metadata
ETH Bibliography
yes
Altmetrics