Classes of Admissible Permutations that are Generatable by Depth-first Traversals of Ordered Trees

DOI10.1093/COMJNL/32.1.76zbMath0664.68066OpenAlexW2066543064MaRDI QIDQ3815535

M. C. Er

Publication date: 1989

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/32.1.76

zbMATH Keywords

orderingsordered treesadmissible permutationsdepth-first traversals

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

This page was built for publication: Classes of Admissible Permutations that are Generatable by Depth-first Traversals of Ordered Trees