On the public citation graph

Fast random generation of binary, t-ary and other types of trees

https://doi.org/10.1007/bf01908600
0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11538.1522-9602openalex-snapshot
Bulletin of Mathematical Biology
inferredcites →https://doi.org/10.1007/978-3-319-44543-4openalex-snapshot
On Maximal Chain Subgraphs and Covers of Bipartite Graphs.
inferredcites →https://doi.org/10.1007/bf01890123openalex-snapshot
The generation of random, binary unordered trees
inferredcites →https://doi.org/10.1007/bf02306021openalex-snapshot
The Estimation of Ultrametric and Path Length Trees from Rectangular Proximity Data
inferredcites →https://doi.org/10.1007/bf02462013openalex-snapshot
An algorithm to equiprobably generate all directed trees withk labeled terminal nodes and unlabeled interior nodes
inferredcites →https://doi.org/10.1016/0001-8708(76)90164-xopenalex-snapshot
Combinatorial algorithms
inferredcites →https://doi.org/10.1016/0012-365x(75)90076-xopenalex-snapshot
The distribution of degrees in a large random tree
inferredcites →https://doi.org/10.1016/s0021-9800(70)80012-6openalex-snapshot
The distance between points in random trees
inferredcites →https://doi.org/10.1017/cbo9780511703799.010openalex-snapshot
A theorem on trees
inferredcites →https://doi.org/10.1137/0206055openalex-snapshot
Generating Binary Trees Lexicographically
inferredcites →https://doi.org/10.1137/0207034openalex-snapshot
Generating t -Ary Trees Lexicographically
inferredcites →https://doi.org/10.1137/0207039openalex-snapshot
Ranking and Listing Algorithms for k -Ary Trees
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.70037openalex-snapshot
Exact Solutions for the Moving Firefighter Problem on Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-81885-2_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-642-51175-2_1openalex-snapshot
Classification and Clustering: Problems for the Future
inferred← citeshttps://doi.org/10.1007/978-3-642-59789-3_20openalex-snapshot
A General Approach to Test the Pertinence of a Consensus Classification
inferred← citeshttps://doi.org/10.1007/978-4-431-65950-1_6openalex-snapshot
How to validate phylogenetic trees? A stepwise procedure
inferred← citeshttps://doi.org/10.1007/bf02616238openalex-snapshot
The generation of random ultrametric matrices representing dendrograms
inferred← citeshttps://doi.org/10.1007/bf03040858openalex-snapshot
Comparison tests for dendrograms: A comparative evaluation
inferred← citeshttps://doi.org/10.1007/s11009-014-9436-1openalex-snapshot
Birth and Death Chains on Finite Trees: Computing their Stationary Distribution and Hitting Times
inferred← citeshttps://doi.org/10.1016/0167-9473(96)88919-5openalex-snapshot
Probabilistic models in cluster analysis
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10080-4openalex-snapshot
Generating random binary trees — A survey
inferred← citeshttps://doi.org/10.1089/cmb.2021.0342openalex-snapshot
The Generalized Robinson-Foulds Distance for Phylogenetic Trees
inferred← citeshttps://doi.org/10.1109/icctd.2010.5646056openalex-snapshot
New perspective for tree searching algorithms: A simple proposition
inferred← citeshttps://doi.org/10.1111/j.1558-5646.1991.tb04385.xopenalex-snapshot
NULL MODELS FOR THE NUMBER OF EVOLUTIONARY STEPS IN A CHARACTER ON A PHYLOGENETIC TREE
inferred← citeshttps://doi.org/10.1145/2882903.2882927openalex-snapshot
A Fast Randomized Algorithm for Multi-Objective Query Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1603.00400openalex-snapshot
A Fast Randomized Algorithm for Multi-Objective Query Optimization
inferred← citeshttps://doi.org/10.5075/epfl-thesis-6995openalex-snapshot
From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.