On the estimate of the size of a directed graph (Q6199473): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Estimating the Efficiency of Backtrack Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on extending Knuth's tree estimator to directed acyclic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4144192 / rank | |||
Normal rank | |||
Latest revision as of 13:13, 27 August 2024
scientific article; zbMATH DE number 7810438
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the estimate of the size of a directed graph |
scientific article; zbMATH DE number 7810438 |
Statements
On the estimate of the size of a directed graph (English)
0 references
28 February 2024
0 references
