Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Generation of binary trees from (0-1) codes

From MaRDI portal
Publication:3989787
Jump to:navigation, search

DOI10.1080/00207169208804058zbMath0742.68024OpenAlexW2022225347MaRDI QIDQ3989787

No author found.

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804058


zbMATH Keywords

binary treebacktrackingcoding schememonotonic order


Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Data structures (68P05)


Related Items

On the generation of binary trees from (0–1) codes ⋮ Single-crossover recombination and ancestral recombination trees



Cites Work

  • Lexicographic generation of ordered trees
  • A note on generating binary trees inA-order andB-order
  • A numbering system for binary trees
  • Generation of Binary Trees from Ballot Sequences
  • Generating Trees and Other Combinatorial Objects Lexicographically
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3989787&oldid=12050660"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki