O(1) Time Algorithms for Combinatorial Generation by Tree Traversal (Q4935301): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1093/comjnl/42.5.400 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/comjnl/42.5.400 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144710417 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1093/COMJNL/42.5.400 / rank | |||
Normal rank | |||
Latest revision as of 16:23, 30 December 2024
scientific article; zbMATH DE number 1395720
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | O(1) Time Algorithms for Combinatorial Generation by Tree Traversal |
scientific article; zbMATH DE number 1395720 |
Statements
O(1) Time Algorithms for Combinatorial Generation by Tree Traversal (English)
0 references
10 April 2000
0 references
