Complexité de problèmes liés aux graphes sans circuit (Q3773334)
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 4033070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexité de problèmes liés aux graphes sans circuit |
scientific article; zbMATH DE number 4033070 |
Statements
Complexité de problèmes liés aux graphes sans circuit (English)
0 references
1987
0 references
transitive reduction
0 references
transitive closure
0 references
acyclic digraphs
0 references
linear time algorithmic solutions
0 references
0.8359760642051697
0 references
0.8224104046821594
0 references
0.8092395067214966
0 references
0.8067764043807983
0 references
