Olivier BodiniLIPN, Francis DurandLIPN, Philippe MarchalLAGA
{"title":"严格递增二叉树的最优生成及其他","authors":"Olivier BodiniLIPN, Francis DurandLIPN, Philippe MarchalLAGA","doi":"arxiv-2406.16396","DOIUrl":null,"url":null,"abstract":"This article presents two novel algorithms for generating random increasing\ntrees. The first algorithm efficiently generates strictly increasing binary\ntrees using an ad hoc method. The second algorithm improves the recursive\nmethod for weighted strictly increasing unary-binary increasing trees,\noptimizing randomness usage.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"18 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Generation of Strictly Increasing Binary Trees and Beyond\",\"authors\":\"Olivier BodiniLIPN, Francis DurandLIPN, Philippe MarchalLAGA\",\"doi\":\"arxiv-2406.16396\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article presents two novel algorithms for generating random increasing\\ntrees. The first algorithm efficiently generates strictly increasing binary\\ntrees using an ad hoc method. The second algorithm improves the recursive\\nmethod for weighted strictly increasing unary-binary increasing trees,\\noptimizing randomness usage.\",\"PeriodicalId\":501216,\"journal\":{\"name\":\"arXiv - CS - Discrete Mathematics\",\"volume\":\"18 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.16396\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.16396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal Generation of Strictly Increasing Binary Trees and Beyond
This article presents two novel algorithms for generating random increasing
trees. The first algorithm efficiently generates strictly increasing binary
trees using an ad hoc method. The second algorithm improves the recursive
method for weighted strictly increasing unary-binary increasing trees,
optimizing randomness usage.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
