The following pages link to (Q4252420):
Displaying 8 items.
- Computing of B-series by automatic differentiation (Q379767) (← links)
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- A study of graph spectra for comparing graphs and trees (Q937426) (← links)
- Computation of order conditions for symplectic partitioned Runge-Kutta schemes with application to optimal control (Q2491138) (← links)
- Computing the maximal canonical form for trees in polynomial time (Q2636446) (← links)
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493) (← links)
- Minimal vertex covers of random trees (Q4968859) (← links)
- Fast Generation of Unlabelled Free Trees using Weight Sequences (Q5856669) (← links)
