Trees in Algebra and Programming - CAAP '96
Subtitle: 21st International Colloquium, Linköping, Sweden, April 22-24, 1996. Proceedings (Lecture Notes in Computer Science)
Edition: 1 edition
Publisher: Springer
Published: April 30, 1996
Language: eng
Format: Paperback
Number of pages: 331
ISBN-13: 9783540610649
Subjects: Mathematical theory of computation; Programming languages; Mathematics; Data processing; Science/Mathematics; Computer Science; Computers; Logic Design; Computer Books: General; Graphic Methods; Data structures (Computer scie; Programming - General; Automata Theory; Automatentheorie; Combinatorics; Computers / Computer Science; Discrete Mathematics; Diskrete Mathematik; Formal Verification; Formale Verifikation; Kombinatorik; Trees (Graph theory); Computational complexity; Congresses; Data structures (Computer science)
First sentence: Local computations on graphs are formalized as modifications of labels (or states) attached to vertices or edges.