Coding and generation of nonisomorphic trees

DOI10.1007/BF01071214MaRDI QIDQ3904622zbMATH OpenOpenAlexFDO

Authors A. V. Kozina

Publication date 1979

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01071214

zbMATH Keywords

coding of nonisomorphic treesgeneration of nonisomorphic treesspanning treestime-sharing-algorithm

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Combinatorial codes (94B25)

Cites work

• The Counting and Coding of Trees of Fixed Diameter

Cited in

(2)

• The generation of random, binary unordered trees
• Random generation of colored trees

This page was built for publication: Coding and generation of nonisomorphic trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3904622)