Efficient enumeration of ordered trees with \(k\) leaves (Q441889): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011576097 / rank | |||
Normal rank | |||
Revision as of 01:35, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient enumeration of ordered trees with \(k\) leaves |
scientific article |
Statements
Efficient enumeration of ordered trees with \(k\) leaves (English)
0 references
8 August 2012
0 references
graph algorithm
0 references
ordered tree
0 references
enumeration
0 references
family tree
0 references
