Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488)
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 to solve the linear ordering problem for oriented tree based graphs |
scientific article; zbMATH DE number 6579402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time algorithms to solve the linear ordering problem for oriented tree based graphs |
scientific article; zbMATH DE number 6579402 |
Statements
Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (English)
0 references
11 May 2016
0 references
linear ordering
0 references
linear time algorithms
0 references
divide-and-conquer graphs
0 references
directed tree
0 references
0 references
0 references
0.8148905634880066
0 references
0.8053552508354187
0 references
0.7885541319847107
0 references
0.7814224362373352
0 references
