Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges (Q5041192)
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: Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges |
scientific article; zbMATH DE number 7601010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges |
scientific article; zbMATH DE number 7601010 |
Statements
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges (English)
0 references
13 October 2022
0 references
minimum linear arrangement
0 references
pick-by-order
0 references
cycle
0 references
tree
0 references
dynamic programming on subsets
0 references
elimination ordering
0 references
2-core
0 references
3-core
0 references
0 references
0 references
0.7262169718742371
0 references
0.7069949507713318
0 references
