On computing the number of topological orderings of a directed acyclic graph (Q3378284)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5016660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing the number of topological orderings of a directed acyclic graph |
scientific article; zbMATH DE number 5016660 |
Statements
30 March 2006
0 references
transitive closure
0 references
0.7795470952987671
0 references
0.7708206176757812
0 references
0.6934956312179565
0 references
0.6902154088020325
0 references
0.6750357747077942
0 references
