An Efficient Method for Indexing All Topological Orders of a Directed Graph (Q2942618)
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 6480907
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient Method for Indexing All Topological Orders of a Directed Graph |
scientific article; zbMATH DE number 6480907 |
Statements
An Efficient Method for Indexing All Topological Orders of a Directed Graph (English)
0 references
11 September 2015
0 references
topological orders
0 references
linear extensions
0 references
permutations
0 references
decision diagrams
0 references
enumerating algorithms
0 references
experimental algorithms
0 references
0.9007283
0 references
0.88984406
0 references
0.88810635
0 references
0.8825445
0 references
0 references
0.87716395
0 references
0.8753826
0 references
