Linear time algorithms on mirror trees (Q2091108)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear time algorithms on mirror trees |
scientific article; zbMATH DE number 7610138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time algorithms on mirror trees |
scientific article; zbMATH DE number 7610138 |
Statements
Linear time algorithms on mirror trees (English)
0 references
31 October 2022
0 references
mirror graphs
0 references
mirror trees
0 references
directed sum-cut
0 references
linear ordering
0 references
linear time complexity
0 references
0 references
0 references
0 references
0 references
0.7592188715934753
0 references
0.7186844944953918
0 references
0.7099840044975281
0 references
